Pages that link to "Item:Q4934788"
From MaRDI portal
The following pages link to A Grötzsch-Type Theorem for List Colourings with Impropriety One (Q4934788):
Displaying 15 items.
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles (Q282304) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- A note on list improper coloring of plane graphs (Q1003695) (← links)
- A short list color proof of Grötzsch's theorem (Q1405112) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- List improper colorings of planar graphs with prescribed girth (Q1972143) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518) (← links)
- (Q4386303) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)
