Acyclic coloring of claw-free graphs with small degree
From MaRDI portal
Publication:2172408
Recommendations
Cites work
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- Acyclic coloring of graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic coloring of graphs with maximum degree 7
- Acyclic coloring of graphs with maximum degree at most six
- Acyclic coloring of graphs without bichromatic long path
- Acyclic colorings of planar graphs
- Acyclic vertex coloring of graphs of maximum degree 5
- Acyclic vertex coloring of graphs of maximum degree six
- Acyclic vertex coloring of graphs of maximum degree six
- Graphs with maximum degree 6 are acyclically 11-colorable
- Graphs with maximum degreee 5 are acyclically 7-colorable
- scientific article; zbMATH DE number 3616457 (Why is no real title available?)
- Improved upper bound for generalized acyclic chromatic number of graphs
- On acyclic colorings of planar graphs
This page was built for publication: Acyclic coloring of claw-free graphs with small degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172408)