Pages that link to "Item:Q1356682"
From MaRDI portal
The following pages link to The colour theorems of Brooks and Gallai extended (Q1356682):
Displaying 36 items.
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
- A unified proof of Brooks' theorem and Catlin's theorem (Q472980) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- Cost colourings of hypergraphs (Q878618) (← links)
- Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
- On list critical graphs (Q1044925) (← links)
- Colour-critical graphs with few edges (Q1584424) (← links)
- List star edge-coloring of subcubic graphs (Q1656917) (← links)
- On the number of edges in hypergraphs critical with respect to strong colourings (Q1971806) (← links)
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems (Q1972133) (← links)
- Cover and variable degeneracy (Q2075519) (← links)
- Generalized hypergraph coloring (Q2214310) (← links)
- On a Lovász-type lemma, applied to Brooks' theorem for list-colouring (Q2275459) (← links)
- DP-degree colorable hypergraphs (Q2333798) (← links)
- On DP-coloring of graphs and multigraphs (Q2360256) (← links)
- Beyond degree choosability (Q2401410) (← links)
- Basis theorems for continuous \(n\)-colorings (Q2431608) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs (Q2515567) (← links)
- List colorings of \(K_5\)-minor-free graphs with special list assignments (Q2911050) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Nondegenerate colourings in the Brooks theorem (Q3225894) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- On list-coloring outerplanar graphs (Q3528160) (← links)
- A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176) (← links)
- Dirac's map-color theorem for choosability (Q4719323) (← links)
- On the Choice Number of Packings (Q4906043) (← links)
- Vertex partition of hypergraphs and maximum degenerate subhypergraphs (Q4958039) (← links)
- Partitions of hypergraphs under variable degeneracy constraints (Q6055378) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
