Acyclic L-coloring of graphs with maximum degrees 5 and 6

DOI10.1016/J.DISC.2019.07.001MaRDI QIDQ2279264zbMATHOpenAlexFDO

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

zbMATH Keywords

list coloringmaximum degreeacyclic coloringvertex coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

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
• 19-linear-colorable graphs with maximum degree 6

Cites work

• scientific article; zbMATH DE number 3616457 (Why is no real title available?)
• scientific article; zbMATH DE number 3639666 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 6914816 (Why is no real title available?)
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic coloring of graphs
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic coloring of graphs without bichromatic long path
• Acyclic colorings of planar graphs
• Acyclic list 7‐coloring of planar graphs
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic vertex coloring of graphs of maximum degree six
• Acyclically 4-colorable triangulations
• Coloring with no 2-colored \(P_4\)'s
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Every toroidal graph is acyclically 8-choosable
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Graphs with maximum degreee 5 are acyclically 7-colorable
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs
• On the acyclic choosability of graphs

Cited in

(11)

• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Acyclic improper list coloring of graphs
• Total-coloring of sparse graphs with maximum degree 6
• scientific article; zbMATH DE number 6837048 (Why is no real title available?)
• Acyclic choosability of graphs with bounded degree
• Acyclic coloring of graphs with maximum degree 7
• Acyclic coloring of claw-free graphs with small degree
• Graph-Theoretic Concepts in Computer Science
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• 19-linear-colorable graphs with maximum degree 6
• Acyclic improper choosability of subcubic graphs

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)