The following pages link to (Q4111622):
Displaying 21 items.
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- Independent sets in the union of two Hamiltonian cycles (Q668015) (← links)
- Independence in graphs with maximum degree four (Q798679) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- On the tightness of the \(\frac {5}{14}\) independence ratio (Q932585) (← links)
- The independence number in graphs of maximum degree three (Q998471) (← links)
- Brooks' graph-coloring theorem and the independence number (Q1229220) (← links)
- A short proof of Catlin's extension of Brooks' theorem (Q1245972) (← links)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
- Lower bounds on the independence number in terms of the degrees (Q1835927) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- Nordhaus-Gaddum and other bounds for the chromatic edge-stability number (Q2011157) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- Independence, odd girth, and average degree (Q3005112) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Some Ramsey-Type Numbers and the Independence Ratio (Q3864546) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
