Pages that link to "Item:Q2910925"
From MaRDI portal
The following pages link to A fractional analogue of Brooks' theorem (Q2910925):
Displaying 14 items.
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- A matroid analogue of a theorem of Brooks for graphs (Q901151) (← links)
- An analog of the Haar condition for simple partial fractions (Q906326) (← links)
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\) (Q1759391) (← links)
- Painting squares in \(\Delta^2-1\) shades (Q2629492) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- A fractional imbedding theorem (Q2849831) (← links)
- (Q3116045) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- Fractional Sylvester–Gallai theorems (Q5170981) (← links)
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
- Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces (Q5232160) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs (Q6081802) (← links)
