On Hamiltonian alternating cycles and paths

DOI10.1016/j.comgeo.2017.05.009zbMath1386.05101arXiv1603.06764OpenAlexW2963240895MaRDI QIDQ1699287

Delia Garijo, Mercè Claverol, Carlos Seara, Alfredo Daniel Garcia, F. Javier Tejel

Publication date: 19 February 2018

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

Full work available at URL: https://arxiv.org/abs/1603.06764

zbMATH Keywords

1-plane graphsbicolored point setsHamiltonian alternating cycles and pathsminimum number of crossings

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (7)

Discrete geometry on colored point sets in the plane -- a survey ⋮ Packing 1-plane Hamiltonian cycles in complete geometric graphs ⋮ Crossing and intersecting families of geometric graphs on point sets ⋮ On geometric graphs on point sets in the plane ⋮ Polynomially solvable cases of the bipartite traveling salesman problem ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ 2-colored point-set embeddings of partial 2-trees

Cites Work

• Unnamed Item
• Simple alternating path problem
• Long alternating paths in bicolored point sets
• Applications of a semi-dynamic convex hull algorithm
• Bipartite embeddings of trees in the plane
• On a straight-line embedding problem of graphs
• On a matching problem in the plane
• Ein Sechsfarbenproblem auf der Kugel
• Plane Geometric Graph Augmentation: A Generic Perspective
• Universal Sets for Straight-Line Embeddings of Bicolored Graphs
• Thirty Essays on Geometric Graph Theory
• Research Problems in Discrete Geometry
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• Matching colored points in the plane: Some new results

This page was built for publication: On Hamiltonian alternating cycles and paths