The fractional chromatic number of triangle-free subcubic graphs
From MaRDI portal
Publication:2509748
DOI10.1016/j.ejc.2013.06.006zbMath1292.05217arXiv1203.1308OpenAlexW2110866863WikidataQ57601347 ScholiaQ57601347MaRDI QIDQ2509748
Tomáš Kaiser, David G. Ferguson, Daniel Král'
Publication date: 29 July 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.1308
Related Items (4)
Spotting Trees with Few Leaves ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
- An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs
- The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three
- Cycles Intersecting Edge-Cuts of Prescribed Sizes
- Some Ramsey-Type Numbers and the Independence Ratio
- Size and independence in triangle‐free graphs with maximum degree three
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5
- A new proof of the independence ratio of triangle-free cubic graphs
This page was built for publication: The fractional chromatic number of triangle-free subcubic graphs