Altermatic number of categorical product of graphs
From MaRDI portal
Publication:1709531
DOI10.1016/j.disc.2018.02.007zbMath1383.05089OpenAlexW2790835273MaRDI QIDQ1709531
Meysam Alishahi, Hossein Hajiabolhassan
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.02.007
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Colorful subhypergraphs in Kneser hypergraphs
- On the chromatic number of general Kneser hypergraphs
- The chromatic number of almost stable Kneser hypergraphs
- The fractional version of Hedetniemi's conjecture is true
- On topological relaxations of chromatic conjectures
- Kneser's conjecture, chromatic number, and homotopy
- Hom complexes and homotopy theory in the category of graphs
- A survey on Hedetniemi's conjecture
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- A combinatorical proof of Kneser's conjecture
- Chromatic number via Turán number
- Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen
- Stable Kneser hypergraphs and ideals in $\mathbb {N}$ with the Nikodým property
- Local chromatic number and distinguishing the strength of topological obstructions
- Equivariant Cohomology and Lower Bounds for Chromatic Numbers
- An approach to hedetniemi's conjecture
- A generalization of Gale's lemma
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Hedetniemi's conjecture and the retracts of a product of graphs
This page was built for publication: Altermatic number of categorical product of graphs