The following pages link to (Q3872499):
Displaying 38 items.
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs (Q400359) (← links)
- A new lower bound on the independence number of a graph and applications (Q405126) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- 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)
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) (Q1759391) (← links)
- On the conjecture of Hajos (Q1835686) (← links)
- Packing and covering triangles in \(K_{4}\)-free planar graphs (Q1926019) (← links)
- A linear hypergraph extension of the bipartite Turán problem (Q2225452) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- On fractional cut covers (Q2312658) (← links)
- On line graphs of subcubic triangle-free graphs (Q2400553) (← links)
- Independence and matching number of some graphs (Q2424729) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- The fractional chromatic number of triangle-free subcubic graphs (Q2509748) (← links)
- Bipartite subgraphs of triangle-free subcubic graphs (Q2519015) (← links)
- On three outer-independent domination related parameters in graphs (Q2656960) (← 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)
- On the Independence Number of Graphs with Maximum Degree 3 (Q3104780) (← links)
- A Ramsey‐type problem and the Turán numbers* (Q4539875) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- Double outer-independent domination number of graphs (Q5023632) (← links)
- Perfect roman domination in regular graphs (Q5155702) (← links)
- Packing in regular graphs (Q5375889) (← links)
- Subcubic triangle-free graphs have fractional chromatic number at most 14/5 (Q5494396) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs (Q6081802) (← links)
