Pages that link to "Item:Q1944128"

The following pages link to Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128):

Displayed 12 items.

• Acyclically 4-colorable triangulations (Q264190) ‎ (← links)
• Acyclic colorings of graphs with bounded degree (Q310229) ‎ (← links)
• Acyclic coloring with few division vertices (Q396683) ‎ (← links)
• Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) ‎ (← links)
• Acyclic choosability of graphs with bounded degree (Q2119462) ‎ (← links)
• Acyclic coloring of claw-free graphs with small degree (Q2172408) ‎ (← links)
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) ‎ (← links)
• Acyclic coloring of graphs and entropy compression method (Q2297725) ‎ (← links)
• Acyclic coloring of graphs with maximum degree at most six (Q2324491) ‎ (← links)
• The \(r\)-acyclic chromatic number of planar graphs (Q2343993) ‎ (← links)
• Acyclic vertex coloring of graphs of maximum degree six (Q2449135) ‎ (← links)
• Acyclic coloring of graphs with maximum degree 7 (Q2657099) ‎ (← links)