Acyclic L-coloring of graphs with maximum degrees 5 and 6
From MaRDI portal
Publication:2279264
DOI10.1016/J.DISC.2019.07.001zbMATH Open1429.05078OpenAlexW2956469290MaRDI QIDQ2279264FDOQ2279264
Authors: Juan Wang, Wenyao Song, Lianying 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
Recommendations
- Acyclic coloring of graphs with maximum degree at most six
- Acyclic 6-colouring of graphs with maximum degree 5 and small maximum average degree
- Acyclic vertex coloring of graphs of maximum degree six
- Acyclic vertex coloring of graphs of maximum degree 5
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic coloring of graphs of maximum degree \(\Delta \)
- Graphs with maximum degreee 5 are acyclically 7-colorable
- Acyclic colourings of graphs with bounded degree
- Acyclic colourings of graphs with bounded degree
- 19-linear-colorable graphs with maximum degree 6
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Note to the paper of Grünbaum on acyclic colorings
- On acyclic colorings of planar graphs
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclically 4-colorable triangulations
- Graphs with maximum degreee 5 are acyclically 7-colorable
- Acyclic Colourings of Planar Graphs with Large Girth
- Title not available (Why is that?)
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Acyclic colorings of planar graphs
- Acyclic coloring of graphs
- Coloring with no 2-colored \(P_4\)'s
- Acyclic colourings of graphs with bounded degree
- Every planar graph has an acyclic 7-coloring
- Every planar graph has an acyclic 8-coloring
- Title not available (Why is that?)
- Acyclic list 7‐coloring of planar graphs
- Acyclic 6-choosability of planar graphs without adjacent short cycles
- Acyclic 5-choosability of planar graphs without 4-cycles
- Acyclic vertex coloring of graphs of maximum degree 5
- On the acyclic choosability of graphs
- Acyclic coloring of graphs without bichromatic long path
- Title not available (Why is that?)
- Acyclic vertex coloring of graphs of maximum degree six
- Every toroidal graph is acyclically 8-choosable
Cited In (11)
- Acyclic improper choosability of subcubic graphs
- Acyclic coloring of graphs with maximum degree 7
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
- Acyclic choosability of graphs with bounded degree
- Acyclic coloring of graphs of maximum degree five: nine colors are enough
- Acyclic coloring of claw-free graphs with small degree
- Graph-Theoretic Concepts in Computer Science
- Acyclic improper list coloring of graphs
- Total-coloring of sparse graphs with maximum degree 6
- Title not available (Why is that?)
- 19-linear-colorable graphs with maximum degree 6
This page was built for publication: Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279264)
