Pages that link to "Item:Q2380076"

The following pages link to A note on 3-choosability of planar graphs (Q2380076):

Displaying 23 items.

• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
• Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
• A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
• A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
• On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
• On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\) (Q2000564) (← links)
• DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
• Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
• Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
• Corrigendum to ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles'' (Q2450936) (← links)
• Planar graphs that have non short cycles with a chord are 3-choosable (Q2470800) (← links)
• A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
• A note on choosability with separation for planar graphs. (Q2716011) (← links)
• A note on 3-choosability of planar graphs related to Montanssier's conjecture (Q2810722) (← links)
• A note on 3-choosability of planar graphs (Q2824705) (← links)
• (Q3180354) (← links)
• 3-Paintability of planar graphs (Q4554554) (← links)
• (Q4642877) (← links)
• (Q5492576) (← links)