The following pages link to (Q3576724):
Displaying 9 items.
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- Acyclic vertex coloring of graphs of maximum degree six (Q2840537) (← links)
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)