scientific article; zbMATH DE number 5222522
From MaRDI portal
Publication:5432047
zbMath1139.05022arXivmath/0505563MaRDI QIDQ5432047
Publication date: 2 January 2008
Full work available at URL: https://arxiv.org/abs/math/0505563
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Relations of low-dimensional topology with graph theory (57M15) Coloring of graphs and hypergraphs (05C15)
Related Items (28)
Neighborhood complexes of some exponential graphs ⋮ 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 ⋮ Hom complexes and homotopy in the category of graphs ⋮ Complexes of graph homomorphisms ⋮ Square-free graphs are multiplicative ⋮ Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ Configuration spaces of labeled points on a circle with two anchors ⋮ Stirling complexes ⋮ Homotopy and Hom construction in the category of finite hypergraphs ⋮ Altermatic number of categorical product of graphs ⋮ Homomorphism complexes, reconfiguration, and homotopy for directed graphs ⋮ Answers to some problems about graph coloring test graphs ⋮ Fundamental Groupoids for Graphs ⋮ Collapsing along monotone poset maps ⋮ Set partition complexes ⋮ Topology of Hom complexes and test graphs for bounding chromatic number ⋮ On topological relaxations of chromatic conjectures ⋮ The universality of Hom complexes of graphs ⋮ Simple homotopy types of Hom-complexes, neighborhood complexes, Lovász complexes, and atom crosscut complexes ⋮ A homotopy category for graphs ⋮ Hom complexes and homotopy theory in the category of graphs ⋮ Homotopy groups of Hom complexes of graphs ⋮ A simple proof for folds on both sides in complexes of graph homomorphisms ⋮ Combinatorial groupoids, cubical complexes, and the Lovász Conjecture ⋮ A combinatorial method to compute explicit homology cycles using discrete Morse theory ⋮ Graph colorings, spaces of edges and spaces of circuits ⋮ A short proof of a conjecture on the connectivity of graph coloring complexes ⋮ Cobounding odd cycle colorings
This page was built for publication:
