Answers to some problems about graph coloring test graphs
From MaRDI portal
Publication:482122
Recommendations
Cites work
- A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex
- A short proof of \(w_{1}^n (\text{Hom}(C_{2r+1}, K_{n+2})) = 0\) for all \(n\) and a graph colouring theorem by Babson and Kozlov
- Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
- Cobounding odd cycle colorings
- Combinatorial algebraic topology
- Complexes of graph homomorphisms
- Graph colorings, spaces of edges and spaces of circuits
- Kneser's conjecture, chromatic number, and homotopy
- Proof of the Lovász conjecture
- Topology of Hom complexes and test graphs for bounding chromatic number
Cited in
(4)
This page was built for publication: Answers to some problems about graph coloring test graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482122)