zbMATH — the first resource for mathematics

On the length of longest alternating paths for multicoloured point sets in convex position. (English) Zbl 1101.05033
Summary: Let \(P\) be a set of points in \(\mathbb R^2\) in general position such that each point is coloured with one of \(k\) colours. An alternating path of \(P\) is a simple polygonal whose edges are straight line segments joining pairs of elements of \(P\) with different colours. In this paper we prove the following: Suppose that each colour class has cardinality \(s\) and \(P\) is the set of vertices of a convex polygon. Then \(P\) always has an alternating path with at least \((k-1)s\) elements. Our bound is asymptotically sharp for odd values of \(k\).

05C15 Coloring of graphs and hypergraphs
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
52B05 Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
Full Text: DOI
[1] Abellanas, M.; García, J.; Hernández, G.; Noy, N.; Ramos, P., Bipartite embeddings of trees in the plane, Discrete appl. math., 93, 141-148, (1999) · Zbl 0929.05021
[2] M. Abellanas, A. García, F. Hurtado, J. Tejel, Caminos alternantes, in: C. Grima, et al. (Eds.), Proceedings X Encuentros de Geometría Computacional (in Spanish), Sevilla, 2003, pp. 7-12. English version at \(\langle\)http://www-ma2.ipc.es/hurtado/alternatingPaths.pdf⟩.
[3] Akiyama, J.; Urrutia, J., Simple alternating path problems, Discrete math., 84, 101-103, (1990) · Zbl 0699.05032
[4] Bondy, J.A.; Murty, U.S.R., Graph theory with applications, (1977), Macmillan Press New York · Zbl 1134.05001
[5] A. Kaneko, M. Kano, On paths in a complete bipartite geometric graph, in: J. Akiyama, et al. (Eds.), Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2098, Springer, Berlin, 2001, pp. 187-191. · Zbl 0991.05064
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.