Subcubic triangle-free graphs have fractional chromatic number at most 14/5
From MaRDI portal
Publication:5494396
DOI10.1112/jlms/jdt085zbMath1295.05103arXiv1301.5296OpenAlexW3098651475MaRDI QIDQ5494396
Zdeněk Dvořák, Jan Volec, Jean-Sébastien Sereni
Publication date: 28 July 2014
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5296
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fractional graph theory, fuzzy graph theory (05C72)
Related Items (6)
Spotting Trees with Few Leaves ⋮ Brooks' Theorem and Beyond ⋮ The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs ⋮ The fractional chromatic number of triangle-free subcubic graphs ⋮ Large Independent Sets in Subquartic Planar Graphs ⋮ Fractional Chromatic Number, Maximum Degree, and Girth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independence in graphs with maximum degree four
- Every planar map is four colorable. I: Discharging
- Planar Ramsey numbers
- The four-colour theorem
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
- A lower bound for the independence number of a planar graph
- Independent sets in triangle-free cubic planar graphs
- The fractional chromatic number of triangle-free subcubic graphs
- Bipartite subgraphs of triangle-free subcubic graphs
- The Fractional Chromatic Number of Graphs of Maximum Degree at Most Three
- Some Ramsey-Type Numbers and the Independence Ratio
- Every Planar Map is Four Colorable
- A (<5)-Colour Theorem for Planar Graphs
- The fractional chromatic number of mycielski's graphs
- Size and independence in triangle‐free graphs with maximum degree three
- A new proof of the independence ratio of triangle-free cubic graphs
This page was built for publication: Subcubic triangle-free graphs have fractional chromatic number at most 14/5
