The r-acyclic chromatic number of planar graphs

DOI10.1007/S10878-013-9619-7MaRDI QIDQ2343993zbMATH OpenOpenAlexFDO

Authors Jiguo Yu, Xin Zhang, Guanghui Wang, Guiying Yan

Publication date 11 May 2015

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-013-9619-7

zbMATH Keywords

acyclic coloringgirthplanar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Programming involving graphs or networks (90C35)

Recommendations

• On \(r\)-acyclic edge colorings of planar graphs
• Acyclic Colourings of Planar Graphs with Large Girth
• The generalized acyclic chromatic number of graphs with large girth
• Improved upper bound for generalized acyclic chromatic number of graphs
• Acyclic 4-colorability of planar graphs without cycles of length 4 or 6

Cites work

• Acyclic coloring of graphs
• Acyclic coloring of graphs of maximum degree
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic colorings of planar graphs
• Acyclic colorings of subcubic graphs
• Acyclic vertex coloring of graphs of maximum degree six
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Coloring Powers of Planar Graphs
• Graph theory with applications
• Graphs with maximum degree 6 are acyclically 11-colorable
• Graphs with maximum degreee 5 are acyclically 7-colorable
• scientific article; zbMATH DE number 3536120 (Why is no real title available?)
• scientific article; zbMATH DE number 3616457 (Why is no real title available?)
• scientific article; zbMATH DE number 790475 (Why is no real title available?)
• On \(r\)-acyclic edge colorings of planar graphs
• On acyclic colorings of planar graphs
• The generalized acyclic chromatic number of graphs with large girth
• Topology of series-parallel networks

Cited in

(4)

• Coloring graphs without bichromatic cycles or paths
• On \(r\)-acyclic edge colorings of planar graphs
• Minimum total coloring of planar graph
• Total coloring of planar graphs without adjacent short cycles

This page was built for publication: The \(r\)-acyclic chromatic number of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2343993)