Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
From MaRDI portal
Publication:2279264
DOI10.1016/j.disc.2019.07.001zbMath1429.05078OpenAlexW2956469290MaRDI QIDQ2279264
Wen Yao Song, Juan Wang, Lian-Ying Miao
Publication date: 12 December 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2019.07.001
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 graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acyclically 4-colorable triangulations
- Acyclic colorings of graphs with bounded degree
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic vertex coloring of graphs of maximum degree 5
- Acyclic coloring of graphs without bichromatic long path
- Note to the paper of Grünbaum on acyclic colorings
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- Every planar graph has an acyclic 8-coloring
- Coloring with no 2-colored \(P_4\)'s
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Every toroidal graph is acyclically 8-choosable
- Acyclic vertex coloring of graphs of maximum degree six
- Graphs with maximum degree 5 are acyclically 7-colorable
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic coloring of graphs
- Acyclic list 7‐coloring of planar graphs
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
- On the acyclic choosability of graphs
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic colorings of planar graphs
This page was built for publication: Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
