Pages that link to "Item:Q536214"
From MaRDI portal
The following pages link to Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214):
Displaying 26 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- Star chromatic bounds (Q327688) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- On \((\delta, \chi)\)-bounded families of graphs (Q540113) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Vertex colouring and forbidden subgraphs -- a survey (Q1889838) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Excluding induced subdivisions of the bull and related graphs (Q2911052) (← links)
- On hitting all maximum cliques with an independent set (Q3067059) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
- \(\omega, \Delta\) and \(\chi\) (Q4242948) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- χ‐bounded families of oriented graphs (Q4646938) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs (Q5300483) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- A quick way to verify if a graph is 3-colorable (Q6633531) (← links)
