On the chromatic number of some geometric type Kneser graphs
From MaRDI portal
Publication:2387203
DOI10.1016/J.COMGEO.2004.10.003zbMATH Open1067.05023OpenAlexW2060173159MaRDI QIDQ2387203FDOQ2387203
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Kneser's conjecture, chromatic number, and homotopy
- A short proof of Kneser's conjecture
- Ramsey-type results for geometric graphs. I
- Covering and coloring polygon-circle graphs
- Some geometric applications of Dilworth's theorem
- Geometric graphs with few disjoint edges
- Title not available (Why is that?)
- Note on geometric graphs
Cited In (15)
- Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
- The Chromatic Number of the Convex Segment Disjointness Graph
- Blocking visibility for points in general position
- Diameter bounds and recursive properties of Full-Flag Johnson graphs
- Geometric achromatic and pseudoachromatic indices
- Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
- The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\)
- Covering the edges of a complete geometric graph with convex polygons
- Achromatic numbers of Kneser graphs
- Partitions of complete geometric graphs into plane trees
- Blocking the \(k\)-holes of point sets in the plane
- Title not available (Why is that?)
- The achromatic number of Kneser graphs
- On geometric graph Ramsey numbers
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane
This page was built for publication: On the chromatic number of some geometric type Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2387203)
