Pages that link to "Item:Q1003695"

The following pages link to A note on list improper coloring of plane graphs (Q1003695):

Displaying 23 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 \((3,1)^*\)-choosable theorem on toroidal graphs (Q765376) (← links)
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
• Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
• Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
• Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
• (3, 1)-choosability of toroidal graphs with some forbidden short cycles (Q2341778) (← links)
• Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable (Q2359954) (← links)
• Improper colorability of planar graphs without prescribed short cycles (Q2436833) (← links)
• Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable (Q2444905) (← links)
• Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable (Q2449160) (← links)
• Decomposition of planar graphs with forbidden configurations (Q2691577) (← links)
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS (Q3397518) (← links)
• Improper Choosability and Property B (Q5325946) (← links)
• A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles (Q6083188) (← links)
• Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs (Q6108003) (← links)
• Decomposition of toroidal graphs without some subgraphs (Q6178668) (← links)
• Decomposing planar graphs without triangular short cycles into a matching and a 3-colorable graph (Q6584736) (← links)
• A note on Alon-Tarsi number of Halin graphs (Q6611029) (← links)