Hamiltonian orthogeodesic alternating paths

DOI10.1016/j.jda.2012.04.012zbMath1255.68188WikidataQ62042457 ScholiaQ62042457MaRDI QIDQ1932349

Luca Grilli, Giuseppe Liotta, Marcus Krug, Ignaz Rutter, Emilio Di Giacomo

Publication date: 18 January 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.04.012

zbMATH Keywords

alternating paths; point-set embeddings; red and blue points

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C45: Eulerian and Hamiltonian graphs

05C62: Graph representations (geometric and intersection representations, etc.)

52C45: Combinatorial complexity of geometric structures

Related Items

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity, 2-colored point-set embeddings of partial 2-trees, 2-colored point-set embeddings of partial 2-trees, Orthogeodesic point-set embedding of trees, Discrete geometry on colored point sets in the plane -- a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Simple alternating path problem
• Long alternating paths in bicolored point sets
• Bipartite embeddings of trees in the plane
• On the length of longest alternating paths for multicoloured point sets in convex position
• Manhattan-Geodesic Embedding of Planar Graphs
• Hamiltonian Alternating Paths on Bicolored Double-Chains
• ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching