The following pages link to (Q3872499):
Displayed 14 items.
- Large minors in graphs with given independence number (Q641195) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- Independence in graphs with maximum degree four (Q798679) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- The independence number in graphs of maximum degree three (Q998471) (← links)
- Independence, clique size and maximum degree (Q1065018) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- The maximum clique problem (Q1318271) (← links)
- Finding independent sets in \(K_4\)-free 4-regular connected graphs (Q1386480) (← links)
- On the conjecture of Hajos (Q1835686) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- Independence, odd girth, and average degree (Q3005112) (← links)
- A Ramsey‐type problem and the Turán numbers* (Q4539875) (← links)