Pages that link to "Item:Q4539872"
From MaRDI portal
The following pages link to Acyclic list 7‐coloring of planar graphs (Q4539872):
Displaying 38 items.
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- 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 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- Acyclic colorings of subcubic graphs (Q834929) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← 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)
- 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)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable (Q2851536) (← 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)
- 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)
- (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)
- A polyhedral study of the acyclic coloring problem (Q5891089) (← 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)
