Fractional chromatic numbers of cones over graphs

DOI10.1002/jgt.1025zbMath0984.05035OpenAlexW1540614089MaRDI QIDQ2757095

Claude Tardif

Publication date: 2 May 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.1025

zbMATH Keywords

fractional chromatic numberfractional coloringMycielski's constructioncategorical graph productcone over a graphfractional clique

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (27)

DOMINATION PARAMETERS IN MYCIELSKI GRAPHS ⋮ The fractional chromatic number of generalized cones over graphs ⋮ Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ On multichromatic numbers of widely colorable graphs ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ Critical graphs without triangles: an optimum density construction ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ Relatively small counterexamples to Hedetniemi's conjecture ⋮ Multicoloring and Mycielski construction ⋮ Multi-coloring the Mycielskian of graphs ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Non-cover generalized Mycielski, Kneser, and Schrijver graphs ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs ⋮ Distinguishing Generalized Mycielskian Graphs ⋮ Topology of Hom complexes and test graphs for bounding chromatic number ⋮ On topological relaxations of chromatic conjectures ⋮ On the multiple Borsuk numbers of sets ⋮ Several parameters of generalized Mycielskians ⋮ Local chromatic number and distinguishing the strength of topological obstructions ⋮ On directed local chromatic number, shift graphs, and Borsuk-like graphs ⋮ Coloring-flow duality of embedded graphs ⋮ Reformulated reciprocal degree distance and reciprocal degree distance of the complement of the Mycielskian graph and generalized Mycielskian ⋮ Symmetry parameters for Mycielskian graphs ⋮ On graphs with strongly independent color-classes

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• The chromatic number of the product of two 4-chromatic graphs is 4
• The fractional chromatic number of mycielski's graphs

This page was built for publication: Fractional chromatic numbers of cones over graphs