Noncrossing Hamiltonian paths in geometric graphs

DOI10.1016/J.DAM.2005.12.010zbMATH Open1120.05051OpenAlexW1995451337MaRDI QIDQ885281FDOQ885281

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

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

zbMATH Keywords

Hamiltonian pathGeometric graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Quasi-planar graphs have a linear number of edges
• Bipartite embeddings of trees in the plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph Drawing
• Topological graphs with no self-intersecting cycle of length 4

Cited In (8)

• Edge-removal and non-crossing configurations in geometric graphs
• Title not available (Why is that?)
• Long non-crossing configurations in the plane
• Title not available (Why is that?)
• Restricted triangulation on circulant graphs
• Graph Drawing
• Packing plane spanning trees and paths in complete geometric graphs
• 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)