Pages that link to "Item:Q2324491"
From MaRDI portal
The following pages link to Acyclic coloring of graphs with maximum degree at most six (Q2324491):
Displaying 9 items.
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← 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 \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Acyclic vertex coloring of graphs of maximum degree six (Q2449135) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree (Q2866451) (← links)
- 19-linear-colorable graphs with maximum degree 6 (Q2887224) (← links)