Noncrossing Hamiltonian paths in geometric graphs

DOI10.1016/J.DAM.2005.12.010MaRDI QIDQ885281zbMATH OpenOpenAlexFDO

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

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

Geometric graphHamiltonian path

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graph Drawing
• Edge-removal and non-crossing configurations in geometric graphs
• scientific article; zbMATH DE number 3884208
• scientific article; zbMATH DE number 1786512
• Hamilton cycles in the path graph of a set of points in convex position

Cites work

• Bipartite embeddings of trees in the plane
• Graph Drawing
• scientific article; zbMATH DE number 1342089 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 1974129 (Why is no real title available?)
• Quasi-planar graphs have a linear number of edges
• Topological graphs with no self-intersecting cycle of length 4

Cited in

(11)

• Restricted triangulation on circulant graphs
• Packing plane spanning trees and paths in complete geometric graphs
• scientific article; zbMATH DE number 3884208 (Why is no real title available?)
• Edge-removal and non-crossing configurations in geometric graphs
• scientific article; zbMATH DE number 6963888 (Why is no real title available?)
• Graph Drawing
• Long non-crossing configurations in the plane
• Noncrossing longest paths and cycles
• Noncrossing longest paths and cycles
• An improved bound for plane covering paths
• A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs

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

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