On graphs with strongly independent color-classes

DOI10.1002/JGT.10165MaRDI QIDQ4736765zbMATH OpenOpenAlexWikidataFDO

Authors

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

zbMATH Keywords

chromatic numberKneser graphsMycielski's constructionneighborhood complex

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Independent sets in k-chromatic graphs
• Generalizations of independence and chromatic numbers of a graph
• scientific article; zbMATH DE number 4123758
• The strong chromatic number of a graph
• A new kind of graph coloring

Cites work

• scientific article; zbMATH DE number 3321960 (Why is no real title available?)
• 4-chromatic graphs with large odd girth
• 4-chromatic projective graphs
• A short proof of Kneser's conjecture
• Fractional chromatic numbers of cones over graphs
• 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
• Sur le coloriage des graphs

Cited in

(23)

• Hedetniemi's conjecture and adjoint functors in thin categories
• Colouring quadrangulations of projective spaces
• Local chromatic number of quadrangulations of surfaces
• \(\mathbb{Z}_2\)-indices and Hedetniemi's conjecture
• Edge-critical subgraphs of Schrijver graphs. II: The general case
• On the topological lower bound for the multichromatic number
• Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
• Clawfreeness of the powers of a graph
• Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
• On colorings of graph powers
• 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\)
• On multichromatic numbers of widely colorable graphs
• Colorful subgraphs in Kneser-like graphs
• On topological relaxations of chromatic conjectures
• Relatively small counterexamples to Hedetniemi's conjecture
• 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)