scientific article; zbMATH DE number 915265

zbMATH Open0853.05035MaRDI QIDQ4890132FDOQ4890132

Authors: Ewa Drgas-Burchardt 

Publication date: 17 October 1996

Title of this publication is not available (Why is that?)

Recommendations

• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• A unified proof of Brooks' theorem and Catlin's theorem
• An extension of Vizing's theorem
• An upper bound for the total chromatic number
• Chromatic coloring with a maximum color class

zbMATH Keywords

Catlin's theoremmonochromatic maximum independent set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• An Upper Bound for cat E
• A Left Weighted Catalan Extension
• A unified proof of Brooks' theorem and Catlin's theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890132)