An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
From MaRDI portal
Publication:2935261
DOI10.1137/120900678zbMath1305.05080arXiv1211.4229OpenAlexW2006668015MaRDI QIDQ2935261
Publication date: 22 December 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.4229
Related Items (3)
Spotting Trees with Few Leaves ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ The fractional chromatic number of triangle-free subcubic graphs
This page was built for publication: An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs