The following pages link to (Q4263464):
Displaying 10 items.
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- Acyclic improper list coloring of graphs (Q5115252) (← links)