Pages that link to "Item:Q2434715"

The following pages link to 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715):

Displaying 9 items.

• 5-choosability of graphs with crossings far apart (Q505910) (← links)
• Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
• Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
• Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
• 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
• Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)