scientific article; zbMATH DE number 3536120

zbMath0344.05116MaRDI QIDQ4111593

David M. Berman, Michael O. Albertson

Publication date: 1976

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

New formulae for the decycling number of graphs ⋮ Acyclic coloring of graphs ⋮ Acyclic colorings of products of trees ⋮ On acyclic colorings of graphs on surfaces ⋮ A new formula for the decycling number of regular graphs ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ Frugal, acyclic and star colourings of graphs ⋮ Every toroidal graph is acyclically 8-choosable ⋮ Acyclic improper colourings of graphs with bounded maximum degree ⋮ Minimum \(k\)-path vertex cover ⋮ Every planar graph has an acyclic 7-coloring ⋮ Acyclic dominating partitions ⋮ On the acyclic chromatic number of Hamming graphs ⋮ Acyclic dominating partitions ⋮ Unnamed Item ⋮ Acyclic Vertex Coloring of Graphs of Maximum Degree Six ⋮ The \(r\)-acyclic chromatic number of planar graphs ⋮ Probabilistic methods in coloring and decomposition problems