An extension of Brooks' theorem to n-degenerate graphs

DOI10.1016/0012-365X(77)90162-5zbMath0351.05124MaRDI QIDQ1235185

John Mitchem

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (10)

Digraphs and Variable Degeneracy ⋮ Unnamed Item ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Partitions of hypergraphs under variable degeneracy constraints ⋮ Generalized DP-colorings of graphs ⋮ Chromatic optimisation: Limitations, objectives, uses, references ⋮ Critically partitionable graphs. II ⋮ Characterizations of strength extremal graphs ⋮ Vertex partition of hypergraphs and maximum degenerate subhypergraphs ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable

Cites Work

• A note on graphs with prescribed clique and point-partition numbers
• Critical Point-Arboritic Graphs
• New proof of brooks' theorem
• k-Degenerate Graphs
• The Point Partition Numbers of Closed 2-Manifolds
• Unnamed Item
• Unnamed Item

This page was built for publication: An extension of Brooks' theorem to n-degenerate graphs