Pages that link to "Item:Q724728"

The following pages link to Minimum choosability of planar graphs (Q724728):

Displaying 8 items.

• A note on the minimum number of choosability of planar graphs (Q266020) (← links)
• Path choosability of planar graphs (Q1627209) (← links)
• Choosability of planar graphs (Q1916256) (← links)
• The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
• The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
• Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
• 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
• Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable (Q2808541) (← links)