On graphs with strongly independent color-classes
From MaRDI portal
Publication:4736765
DOI10.1002/JGT.10165zbMATH Open1042.05041OpenAlexW2599950914WikidataQ56389109 ScholiaQ56389109MaRDI QIDQ4736765FDOQ4736765
Author name not available (Why is that?)
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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Sur le coloriage des graphs
- Kneser's conjecture, chromatic number, and homotopy
- A short proof of Kneser's conjecture
- 4-chromatic projective graphs
- On the chromatic number of cube-like graphs
- Fractional chromatic numbers of cones over graphs
- On color critical graphs
- On constructive methods in the theory of colour-critical graphs
- 4-chromatic graphs with large odd girth
- Title not available (Why is that?)
Cited In (23)
- Colouring quadrangulations of projective spaces
- Local chromatic number of quadrangulations of surfaces
- Hedetniemi's conjecture and adjoint functors in thin categories
- \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture
- Edge-critical subgraphs of Schrijver graphs. II: The general case
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
- On the topological lower bound for the multichromatic number
- Clawfreeness of the powers of a graph
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
- On colorings of graph powers
- On multichromatic numbers of widely colorable graphs
- On inverse powers of graphs and topological implications of Hedetniemi's conjecture
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- Colorful subgraphs in Kneser-like graphs
- Relatively small counterexamples to Hedetniemi's conjecture
- On topological relaxations of chromatic conjectures
- Critical graphs without triangles: an optimum density construction
- Warmth and edge spaces of graphs
- Generalised Mycielski graphs and the Borsuk-Ulam theorem
- Local chromatic number and distinguishing the strength of topological obstructions
- The chromatic number of the product of 14-chromatic graphs can be 13
- Topology of Hom complexes and test graphs for bounding chromatic number
This page was built for publication: On graphs with strongly independent color-classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736765)
