A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
From MaRDI portal
Publication:1815327
DOI10.1016/0012-365X(95)00082-8zbMath0859.05044MaRDI QIDQ1815327
Publication date: 7 November 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Brooks' Theorem and Beyond ⋮ The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices ⋮ Brooks' theorem for generalized dart graphs ⋮ Dichotomy for Coloring of Dart Graphs ⋮ Backbone colorings of graphs with bounded degree ⋮ Odd connection and odd vertex-connection of graphs ⋮ Backbone coloring of graphs with galaxy backbones ⋮ Backbone coloring of graphs with galaxy backbones
Cites Work
This page was built for publication: A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
