On the connectivity of the disjointness graph of segments of point sets in general position in the plane

DOI10.46298/dmtcs.6678zbMath1515.05099arXiv2007.15127MaRDI QIDQ6045406

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

Publication date: 30 May 2023

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

connectivityMenger's theoremcrossings of segmentsdisjointness graph of segments

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Connectivity (05C40)

Related Items (1)

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

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• Using determining sets to distinguish Kneser graphs
• A short proof of Kneser's conjecture
• The super-connectivity of Kneser graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• On the chromatic number of some geometric type Kneser graphs
• On the diameter of Kneser graphs
• Disjointness graphs of segments
• The Chromatic Number of the Convex Segment Disjointness Graph
• The Chromatic Number of the Disjointness Graph of the Double Chain
• 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

This page was built for publication: On the connectivity of the disjointness graph of segments of point sets in general position in the plane