Answers to some problems about graph coloring test graphs

DOI10.1016/j.ejc.2014.10.006zbMath1304.05051arXiv1303.1277OpenAlexW2962970030MaRDI QIDQ482122

Takahiro Matsushita

Publication date: 19 December 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

homotopy test graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ Homotopy types of the Hom complexes of graphs

Cites Work

• Unnamed Item
• Kneser's conjecture, chromatic number, and homotopy
• 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
• Graph colorings, spaces of edges and spaces of circuits
• Topology of Hom complexes and test graphs for bounding chromatic number
• Complexes of graph homomorphisms
• Proof of the Lovász conjecture
• A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex
• Cobounding odd cycle colorings
• Combinatorial algebraic topology

This page was built for publication: Answers to some problems about graph coloring test graphs