Pages that link to "Item:Q4539872"
From MaRDI portal
The following pages link to Acyclic list 7‐coloring of planar graphs (Q4539872):
Displayed 20 items.
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- 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 with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic colorings of subcubic graphs (Q834929) (← links)
- Linear choosability of graphs (Q932648) (← 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)
- Linear coloring of planar graphs with large girth (Q1045057) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← 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)
- A Conjecture of Borodin and a Coloring of Grünbaum (Q3439434) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)