scientific article

zbMath0554.05025MaRDI QIDQ3216674

Albrecht Beutelspacher, P.-R. Hering

Publication date: 1984

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

zbMATH Keywords

chromatic numberconnected graphsubdivision graphcritical graphmaximal degreeBrooks theoremk-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

On the Grundy and \(b\)-chromatic numbers of a graph ⋮ Unnamed Item ⋮ Colouring graphs when the number of colours is almost the maximum degree ⋮ On the Grundy Number of a Graph ⋮ Coloring Graphs with Dense Neighborhoods ⋮ A strengthening of Brooks' theorem

This page was built for publication: