Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian

DOI10.1016/j.dam.2023.09.010arXiv2303.16700OpenAlexW4386951414MaRDI QIDQ6184321

Unnamed Author, Jesús Leaños, Christophe Ndjatchi

Publication date: 24 January 2024

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

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

zbMATH Keywords

Hamiltonian cyclesdisjointness graph of segmentsrectilinear drawings of complete graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• On the chromatic number of disjointness graphs of curves
• 3-symmetric and 3-decomposable geometric drawings of \(K_n\)
• On characterization of Hamiltonian graphs
• One criterion of existence of a Hamiltonian cycle
• The super-connectivity of Kneser graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• On the chromatic number of some geometric type Kneser graphs
• Recent advances on the Hamiltonian problem: survey III
• A note on Hamiltonian circuits
• Conway’s Conjecture for Monotone Thrackles
• Disjointness graphs of segments
• The Chromatic Number of the Convex Segment Disjointness Graph
• The Chromatic Number of the Disjointness Graph of the Double Chain
• Enumerating order types for small sets with applications
• Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane

This page was built for publication: Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian