Acyclic 3-coloring of generalized Petersen graphs

DOI10.1007/s10878-014-9799-9zbMath1333.05131OpenAlexW2000968579MaRDI QIDQ5963660

Zepeng Li, Zehui Shao, En-Qiang Zhu, Chanjuan Liu, Jin Xu

Publication date: 23 February 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-014-9799-9

zbMATH Keywords

cubic graphsacyclic coloringgeneralized Petersen graphstriconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items

Injective edge coloring of generalized Petersen graphs, Strong edge chromatic index of the generalized Petersen graphs, The strong metric dimension of some generalized Petersen graphs, Hardness transitions and uniqueness of acyclic colouring, Weakly convex and convex domination numbers for generalized Petersen and flower snark graphs

Uses Software

• nauty
• ColPack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic coloring with few division vertices
• Acyclically 3-colorable planar graphs
• Every planar graph has an acyclic 7-coloring
• Every planar graph has an acyclic 8-coloring
• Minimum feedback vertex set and acyclic coloring.
• Acyclic colorings of graph subdivisions revisited
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
• On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• Layout of Graphs with Bounded Tree-Width
• A theorem on tait colorings with an application to the generalized Petersen graphs
• Acyclic colorings of planar graphs