Pages that link to "Item:Q1222168"
From MaRDI portal
The following pages link to Note to the paper of Grünbaum on acyclic colorings (Q1222168):
Displayed 23 items.
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Oriented colorings of triangle-free planar graphs (Q834898) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- Acyclic colorings of locally planar graphs (Q1767633) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic edge chromatic number of outerplanar graphs (Q3055902) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- On some arboricities in planar graphs (Q3439376) (← links)
- Star coloring planar graphs from small lists (Q3553237) (← links)
- Star coloring bipartite planar graphs (Q3605156) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Acyclic list 7‐coloring of planar graphs (Q4539872) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
- Acyclic colouring of 1-planar graphs (Q5954081) (← links)