The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three

DOI10.1137/080712635zbMath1207.05054OpenAlexW2032893230MaRDI QIDQ3058529

Hamed Hatami, Xuding Zhu

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080712635

zbMATH Keywords

fractional chromatic numbercubic graphstriangle-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (10)

Spotting Trees with Few Leaves ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) ⋮ Independent sets in triangle-free cubic planar graphs ⋮ The fractional chromatic number of triangle-free subcubic graphs ⋮ Bipartite subgraphs of triangle-free subcubic graphs ⋮ High-girth cubic graphs are homomorphic to the Clebsch graph ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ On colorings of graph powers

This page was built for publication: The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three