Acyclic improper colouring of graphs with maximum degree 4

DOI10.1007/s11425-014-4828-9zbMath1308.05048OpenAlexW2258202916MaRDI QIDQ2018890

Elżbieta Sidorowicz, Anna Fiedorowicz

Publication date: 26 March 2015

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-014-4828-9

zbMATH Keywords

hereditary propertybounded degree graphacyclic colouringacyclic improper colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Acyclic colorings of graphs with bounded degree

Uses Software

• ColPack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Acyclic colorings of graphs with bounded degree
• The complexity of some acyclic improper colourings
• Acyclic colorings of subcubic graphs
• On acyclic colorings of planar graphs
• On acyclic colorings of graphs on surfaces
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Graphs with maximum degree 5 are acyclically 7-colorable
• Estimation of sparse hessian matrices and graph coloring problems
• Acyclic Colourings of Planar Graphs with Large Girth
• A survey of hereditary properties of graphs
• Acrylic improper colorings of graphs
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
• Acyclic dominating partitions
• Acyclic colorings of planar graphs
• Acyclic colouring of 1-planar graphs

This page was built for publication: Acyclic improper colouring of graphs with maximum degree 4