Pages that link to "Item:Q1972143"
From MaRDI portal
The following pages link to List improper colorings of planar graphs with prescribed girth (Q1972143):
Displaying 26 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)
- 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)
- Path choosability of planar graphs (Q1627209) (← links)
- Splitting a planar graph of girth 5 into two forests with trees of small diameter (Q1752682) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Colouring planar graphs with bounded monochromatic components (Q2182229) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- On 2-defective DP-colorings of sparse graphs (Q2225422) (← links)
- Defective DP-colorings of sparse multigraphs (Q2225451) (← links)
- Defective DP-colorings of sparse simple graphs (Q2237221) (← links)
- Planar graphs with girth at least 5 are \((3, 4)\)-colorable (Q2329168) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← links)
- Limits of Near-Coloring of Sparse Graphs (Q2874099) (← links)
- (1,<i>k</i>)-Coloring of Graphs with Girth at Least Five on a Surface (Q2978189) (← links)
- List strong linear 2-arboricity of sparse graphs (Q3005110) (← links)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Improper choosability of graphs and maximum average degree (Q5486272) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)
- An (F1,F4)‐partition of graphs with low genus and girth at least 6 (Q6056804) (← links)
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
- Sparse critical graphs for defective DP-colorings (Q6204323) (← links)
