Pages that link to "Item:Q5469027"

The following pages link to On the acyclic choosability of graphs (Q5469027):

Displaying 21 items.

• A note on the acyclic 3-choosability of some planar graphs (Q708344) (← 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 without adjacent short cycles (Q713156) (← links)
• Acyclic edge colouring of planar graphs without short cycles (Q968412) (← 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)
• Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
• The method of coloring in graphs and its application (Q2429917) (← links)
• Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
• Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
• Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
• A Conjecture of Borodin and a Coloring of Grünbaum (Q3439434) (← links)
• Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
• (Q4578234) (← 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)
• Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
• A polyhedral study of the acyclic coloring problem (Q5916097) (← links)