On the chromatic number of some geometric type Kneser graphs

DOI10.1016/j.comgeo.2004.10.003zbMath1067.05023OpenAlexW2060173159MaRDI QIDQ2387203

Yanyan Li

Publication date: 2 September 2005

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.10.003

zbMATH Keywords

Geometric graphsPairwise crossing edgesPairwise disjoint edges

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Geometric achromatic and pseudoachromatic indices ⋮ Blocking visibility for points in general position ⋮ On the connectivity of the disjointness graph of segments of point sets in general position in the plane ⋮ Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian ⋮ The Chromatic Number of the Convex Segment Disjointness Graph ⋮ Blocking the \(k\)-holes of point sets in the plane ⋮ The achromatic number of Kneser graphs ⋮ Diameter bounds and recursive properties of Full-Flag Johnson graphs ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Partitions of complete geometric graphs into plane trees ⋮ On geometric graph Ramsey numbers ⋮ Achromatic numbers of Kneser graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• A short proof of Kneser's conjecture
• Some geometric applications of Dilworth's theorem
• Covering and coloring polygon-circle graphs
• Ramsey-type results for geometric graphs. I
• Geometric graphs with few disjoint edges
• Note on geometric graphs

This page was built for publication: On the chromatic number of some geometric type Kneser graphs