ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE

DOI10.1142/S021819590000005XzbMath1074.68640OpenAlexW2158107054MaRDI QIDQ4682205

Kiyoshi Yoshimoto, Atsushi Kaneko, Mikio Kano

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590000005x

zbMATH Keywords

crossing numberHamilton cycleplaneline embeddingTwo point sets

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (13)

Discrete geometry on colored point sets in the plane -- a survey ⋮ Packing 1-plane Hamiltonian cycles in complete geometric graphs ⋮ Hamiltonian orthogeodesic alternating paths ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Crossing and intersecting families of geometric graphs on point sets ⋮ On Hamiltonian alternating cycles and paths ⋮ On geometric graphs on point sets in the plane ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Encompassing colored planar straight line graphs ⋮ Long alternating paths in bicolored point sets ⋮ Vertex-colored encompassing graphs ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees

Cites Work

• Simple alternating path problem
• Intersection number of two connected geometric graphs

This page was built for publication: ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE