Independence in graphs with maximum degree four
From MaRDI portal
Publication:798679
DOI10.1016/0095-8956(84)90058-3zbMath0547.05057OpenAlexW2046039478MaRDI QIDQ798679
Publication date: 1984
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(84)90058-3
Related Items (25)
Bounded clique cover of some sparse graphs ⋮ Transversals and independence in linear hypergraphs with maximum degree two ⋮ New bounds on the independence number of connected graphs ⋮ On line graphs of subcubic triangle-free graphs ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ Graph classes and Ramsey numbers ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Independence and matching number in graphs with maximum degree 4 ⋮ $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five ⋮ An improved lower bound on the independence number of a graph ⋮ Independence, odd girth, and average degree ⋮ Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three ⋮ Induced 2-degenerate subgraphs of triangle-free planar graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Independent sets in triangle-free cubic planar graphs ⋮ Counting independent sets in cubic graphs of given girth ⋮ Fractional Coloring of Planar Graphs of Girth Five ⋮ Zero forcing in claw-free cubic graphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Independence in graphs with maximum degree four ⋮ Fractional Chromatic Number, Maximum Degree, and Girth ⋮ An invariant for minimum triangle-free graphs
Cites Work
This page was built for publication: Independence in graphs with maximum degree four
