Acyclic coloring of graphs with maximum degree 7
From MaRDI portal
Publication:2657099
DOI10.1007/s00373-020-02254-wzbMath1470.05063OpenAlexW3100968606MaRDI QIDQ2657099
Juan Wang, Yunlong Liu, Wen Yao Song, Lian-Ying Miao
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02254-w
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
Acyclic choosability of graphs with bounded degree ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ Coloring squares of planar graphs with maximum degree at most five
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclic vertex coloring of graphs of maximum degree 5
- On acyclic colorings of planar graphs
- Improved upper bound for generalized acyclic chromatic number of graphs
- Disconnected \(g_c\)-critical graphs
- Planar graphs without chordal 6-cycles are 4-choosable
- Minimum feedback vertex set and acyclic coloring.
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
- Acyclic coloring of graphs with maximum degree at most six
- Acyclic coloring of IC-planar graphs
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic vertex coloring of graphs of maximum degree six
- Acyclic Vertex Coloring of Graphs of Maximum Degree Six
- Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
- Graphs with maximum degree 5 are acyclically 7-colorable
- On acyclic colorings of direct produts
- Acyclic coloring of graphs
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Layout of Graphs with Bounded Tree-Width
- Acyclic colorings of planar graphs
This page was built for publication: Acyclic coloring of graphs with maximum degree 7
