Pages that link to "Item:Q4376504"
From MaRDI portal
The following pages link to Brooks-type theorems for choosability with separation (Q4376504):
Displaying 22 items.
- Coloring, sparseness and girth (Q312271) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
- The colour theorems of Brooks and Gallai extended (Q1356682) (← links)
- A note on not-4-list colorable planar graphs (Q1640221) (← links)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- Choosability with union separation (Q1690218) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
- An extension of Thomassen's result on choosability (Q2139819) (← links)
- Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← links)
- On choosability with separation of planar graphs with lists of different sizes (Q2346342) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- Separation Choosability and Dense Bipartite Induced Subgraphs (Q5222550) (← links)
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs (Q5418773) (← links)
- Single‐conflict colouring (Q6055933) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
- Minimal abundant packings and choosability with separation (Q6651912) (← links)
- List dynamic 4-coloring of planar graphs (Q6660058) (← links)
