On the chromatic number of some geometric type Kneser graphs

DOI10.1016/J.COMGEO.2004.10.003MaRDI QIDQ2387203zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On the chromatic number of the general Kneser-graph
• On chromatic number of general Kneser graphs
• scientific article; zbMATH DE number 3851122
• The achromatic number of Kneser graphs
• scientific article; zbMATH DE number 3730165

Cites work

• scientific article; zbMATH DE number 3643294 (Why is no real title available?)
• scientific article; zbMATH DE number 1017008 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• A short proof of Kneser's conjecture
• Covering and coloring polygon-circle graphs
• Geometric graphs with few disjoint edges
• Kneser's conjecture, chromatic number, and homotopy
• Note on geometric graphs
• Ramsey-type results for geometric graphs. I
• Some geometric applications of Dilworth's theorem

Cited in

(16)

• Blocking visibility for points in general position
• Covering the edges of a complete geometric graph with convex polygons
• Blocking the \(k\)-holes of point sets in the plane
• scientific article; zbMATH DE number 3851122 (Why is no real title available?)
• Disjointness graphs of segments in \(\mathbb{R}^2\) are almost all Hamiltonian
• The chromatic number of finite type-graphs
• Geometric achromatic and pseudoachromatic indices
• Partitions of complete geometric graphs into plane trees
• The chromatic number of the convex segment disjointness graph
• Achromatic numbers of Kneser graphs
• Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
• The maximum chromatic number of the disjointness graph of segments on \(n\)-point sets in the plane with \(n\leq 16\)
• On geometric graph Ramsey numbers
• The achromatic number of Kneser graphs
• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• 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)