Pages that link to "Item:Q326497"

The following pages link to A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497):

Displaying 8 items.

• On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
• A \((3,1)^*\)-choosable theorem on toroidal graphs (Q765376) (← links)
• A note on list improper coloring of plane graphs (Q1003695) (← links)
• Sufficient conditions on planar graphs to have a relaxed DP-3-coloring (Q2000575) (← links)
• Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
• A note on 3-choosability of planar graphs related to Montanssier's conjecture (Q2810722) (← links)
• The result on \((3,1)^\ast \)-choosability of graphs of nonnegative characteristic without 4-cycles and intersecting triangles. (Q2822835) (← links)
• (Q4642877) (← links)