Pages that link to "Item:Q310229"
From MaRDI portal
The following pages link to Acyclic colorings of graphs with bounded degree (Q310229):
Displaying 20 items.
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← 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 with maximum degree at most six (Q2324491) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Acyclic 4-edge colouring of non-regular subcubic graphs in linear time (Q2449094) (← links)
- Acyclic colouring of some line graphs (Q2844386) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- (Q3575469) (redirect page) (← links)
- (Q4263464) (← links)
- Acrylic improper colorings of graphs (Q4265591) (← links)
- On the chromatic spectrum of acyclic decompositions of graphs (Q5434246) (← links)
- Acyclic, star, and injective colouring: bounding the diameter (Q5925554) (← links)