Independence in graphs with maximum degree four

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Some Ramsey-Type Numbers and the Independence Ratio
Title not available (Why is that?)
Some graph theoretic results associated with Ramsey's theorem
Independence in graphs with maximum degree four
Title not available (Why is that?)

Cited In (27)

Independent sets in $\{\text{claw}, K_4 \}$-free 4-regular graphs
Graph classes and Ramsey numbers
Transversals and independence in linear hypergraphs with maximum degree two
Independence in graphs with maximum degree four
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
Small 1-defective Ramsey numbers in perfect graphs
Exact values of defective Ramsey numbers in graph classes
Induced 2-degenerate subgraphs of triangle-free planar graphs
Contact graphs of boxes with unidirectional contacts
Fractional Coloring of Planar Graphs of Girth Five
Further Improvement on Maximum Independent Set in Degree-4 Graphs
Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
Independence and matching number in graphs with maximum degree 4
Zero forcing in claw-free cubic graphs
Bounded clique cover of some sparse graphs
Fractional Chromatic Number, Maximum Degree, and Girth
On line graphs of subcubic triangle-free graphs
An invariant for minimum triangle-free graphs
The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3
An improved lower bound on the independence number of a graph
$(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five
Finding independent sets in $K_4$-free 4-regular connected graphs
Independence, odd girth, and average degree
Independent sets in triangle-free cubic planar graphs
New bounds on the independence number of connected graphs
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
Counting independent sets in cubic graphs of given girth

This page was built for publication: Independence in graphs with maximum degree four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798679)