Pages that link to "Item:Q798679"
From MaRDI portal
The following pages link to Independence in graphs with maximum degree four (Q798679):
Displaying 25 items.
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Independence in graphs with maximum degree four (Q798679) (← links)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
- Induced 2-degenerate subgraphs of triangle-free planar graphs (Q1753031) (← links)
- Counting independent sets in cubic graphs of given girth (Q1791708) (← links)
- Small 1-defective Ramsey numbers in perfect graphs (Q2010929) (← links)
- Exact values of defective Ramsey numbers in graph classes (Q2067502) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Independence and matching number in graphs with maximum degree 4 (Q2439118) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs (Q2689127) (← links)
- The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
- Independence, odd girth, and average degree (Q3005112) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832) (← links)
- Fractional Chromatic Number, Maximum Degree, and Girth (Q5013575) (← links)
- $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five (Q5128509) (← links)
- An invariant for minimum triangle-free graphs (Q5197603) (← links)
- Fractional Coloring of Planar Graphs of Girth Five (Q5217825) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
