Long alternating paths in bicolored point sets

DOI10.1016/j.disc.2007.08.013zbMath1168.05320OpenAlexW2004288058MaRDI QIDQ941368

Géza Tóth, Jan Kynčl, János Pach

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/129259

zbMATH Keywords

bicolored point setnoncrossing alternating path

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Discrete geometry on colored point sets in the plane -- a survey, Upper bounds for the necklace folding problems, Geometric planar networks on bichromatic collinear points, Hamiltonian orthogeodesic alternating paths, The Mathematics of Ferran Hurtado: A Brief Survey, On Hamiltonian alternating cycles and paths, On geometric graphs on point sets in the plane, Notes on the Twisted Graph, Separated Matchings and Small Discrepancy Colorings, Rainbow polygons for colored point sets in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Ramsey-type results for geometric graphs. II
• Bipartite embeddings of trees in the plane
• The rooted tree embedding problem into points in the plane
• Balanced convex partitions of measures in \(\mathbb R^{2}\)
• Generalizing ham sandwich cuts to equitable subdivisions
• On a straight-line embedding problem of graphs
• On the length of longest alternating paths for multicoloured point sets in convex position
• Research Problems in Discrete Geometry
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Simultaneous partitions of measures by \(k\)-fans