Hamiltonicity and colorings of arrangement graphs

DOI10.1016/j.dam.2006.04.006zbMath1108.05058OpenAlexW2003299221MaRDI QIDQ860408

Stefan Felsner, Ferran Hurtado, Ileana Streinu, Marc Noy

Publication date: 9 January 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.04.006

zbMATH Keywords

connectivityHamilton pathplanar graphcoloringHamilton cycleprojective-planar graphHamilton decompositioncircle and pseudocircle arrangementline and pseudoline arrangement

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items

On degree sequences and eccentricities in pseudoline arrangement graphs ⋮ The symmetry property of (n,k)‐arrangement graph ⋮ The unavoidable arrangements of pseudocircles ⋮ Some Conjectures and Questions in Chromatic Topological Graph Theory

Uses Software

• Cinderella

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decomposition of Cayley graphs of degree 4
• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Arrangement graphs: A class of generalized star graphs
• Planar graphs: Theory and algorithms
• 4-connected projective planar graphs are Hamiltonian
• Finding Hamiltonian circuits in arrangements of Jordan curves is NP- complete
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• A Theorem on Planar Graphs
• From the theory of regular graphs of third and fourth degree
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Bounding the number of embeddings of 5-connected projective-planar graphs
• PROPERTIES OF ARRANGEMENT GRAPHS
• A theorem on paths in planar graphs
• Sweeps, arrangements and signotopes

This page was built for publication: Hamiltonicity and colorings of arrangement graphs