Pages that link to "Item:Q2279264"
From MaRDI portal
The following pages link to Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264):
Displaying 10 items.
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Acyclic improper choosability of subcubic graphs (Q2009524) (← links)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- Acyclic coloring of claw-free graphs with small degree (Q2172408) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- 19-linear-colorable graphs with maximum degree 6 (Q2887224) (← links)
- (Q3134386) (← links)
- Acyclic improper list coloring of graphs (Q5115252) (← links)