Pages that link to "Item:Q868377"

The following pages link to A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377):

Displaying 16 items.

• Steinberg's conjecture is false (Q345097) (← links)
• Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
• A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
• A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
• On sufficient conditions for planar graphs to be 5-flexible (Q2117537) (← links)
• Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
• A note on 3-choosability of planar graphs (Q2380076) (← links)
• Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)