A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs

DOI10.1016/J.COMGEO.2008.07.002zbMATH Open1146.05308OpenAlexW1992593977MaRDI QIDQ950403FDOQ950403

Authors: A. P. Figueroa 

Publication date: 22 October 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.07.002

Recommendations

• Ramsey-type results for geometric graphs. II
• scientific article; zbMATH DE number 2145233
• Graph Drawing
• On the length of longest alternating paths for multicoloured point sets in convex position
• Noncrossing Hamiltonian paths in geometric graphs

zbMATH Keywords

convex geometric graphsalternating non-crossing pathnon-crossing path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cites Work

• Ramsey-type results for geometric graphs. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the length of longest alternating paths for multicoloured point sets in convex position

Cited In (1)

• Graph Drawing

This page was built for publication: A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950403)