On graphs with strongly independent color-classes
From MaRDI portal
Publication:4736765
DOI10.1002/jgt.10165zbMath1042.05041OpenAlexW2599950914WikidataQ56389109 ScholiaQ56389109MaRDI QIDQ4736765
No author found.
Publication date: 6 August 2004
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10165
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (22)
The chromatic number of the product of 14-chromatic graphs can be 13 ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Edge-critical subgraphs of Schrijver graphs. II: The general case ⋮ Warmth and edge spaces of graphs ⋮ On multichromatic numbers of widely colorable graphs ⋮ Clawfreeness of the powers of a graph ⋮ Local chromatic number of quadrangulations of surfaces ⋮ Critical graphs without triangles: an optimum density construction ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ Topology of Hom complexes and test graphs for bounding chromatic number ⋮ On the topological lower bound for the multichromatic number ⋮ On topological relaxations of chromatic conjectures ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture ⋮ Generalised Mycielski graphs and the Borsuk-Ulam theorem ⋮ On colorings of graph powers ⋮ Multiplicative graphs and semi-lattice endomorphisms in the category of graphs ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture ⋮ Colouring quadrangulations of projective spaces ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
Cites Work
- Unnamed Item
- Kneser's conjecture, chromatic number, and homotopy
- On color critical graphs
- On constructive methods in the theory of colour-critical graphs
- On the chromatic number of cube-like graphs
- A short proof of Kneser's conjecture
- 4-chromatic graphs with large odd girth
- Fractional chromatic numbers of cones over graphs
- 4-chromatic projective graphs
- Sur le coloriage des graphs
This page was built for publication: On graphs with strongly independent color-classes
