Noncrossing Hamiltonian paths in geometric graphs

DOI10.1016/j.dam.2005.12.010zbMath1120.05051OpenAlexW1995451337MaRDI QIDQ885281

Jakub Černý, Vít Jelínek, Jan Kára, Zdeněk Dvořák

Publication date: 8 June 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.12.010

zbMATH Keywords

Hamiltonian pathGeometric graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (4)

Packing plane spanning trees and paths in complete geometric graphs ⋮ Restricted triangulation on circulant graphs ⋮ Unnamed Item ⋮ Long non-crossing configurations in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bipartite embeddings of trees in the plane
• Quasi-planar graphs have a linear number of edges
• Graph Drawing
• Topological graphs with no self-intersecting cycle of length 4

This page was built for publication: Noncrossing Hamiltonian paths in geometric graphs