Pages that link to "Item:Q5901353"

The following pages link to Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353):

Displaying 21 items.

• Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
• Acyclic 4-choosability of planar graphs (Q616366) (← links)
• Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
• What is on his mind? (Q709300) (← links)
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
• Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
• On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← links)
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901) (← links)
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
• An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
• Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
• A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
• Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
• Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
• (Q4578234) (← links)
• Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
• Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)