Hamiltonian Alternating Paths on Bicolored Double-Chains

DOI10.1007/978-3-642-00219-9_18zbMath1213.68435OpenAlexW1522547558MaRDI QIDQ3611851

Rudolf Stolař, Pavel Valtr, Josef Cibulka, Jan Kynčl, Viola Mészáros

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_18

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Hamiltonian orthogeodesic alternating paths ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Separated Matchings and Small Discrepancy Colorings

Cites Work

• Bipartite embeddings of trees in the plane
• Lower bounds on the number of crossing-free subgraphs of \(K_N\)
• Research Problems in Discrete Geometry
• Graph Drawing
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian Alternating Paths on Bicolored Double-Chains