scientific article; zbMATH DE number 798659

zbMATH Open0833.05035MaRDI QIDQ4848784FDOQ4848784

Author name not available (Why is that?)

Publication date: 5 March 1996

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

zbMATH Keywords

maximum degreetotal chromatic number

Mathematics Subject Classification ID

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

Cited In (12)

• An upper bound for the total chromatic number of dense graphs
• Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Total chromatic number of graphs of odd order and high degree
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
• An Improvement of Hind's Upper Bound on the Total Chromatic Number
• The total chromatic number of graphs of even order and high degree
• Total chromatic number of regular graphs of odd order and high degree
• Graphs with chromatic number close to maximum degree
• The chromatic index of graphs of high maximum degree
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• The total chromatic number of graphs having large maximum degree 👍 👎
• A bound on the total chromatic number 👍 👎
• Title not available (Why is that?) 👍 👎
• The total chromatic number of graphs of even order and high degree 👍 👎
• The Total Chromatic Number of Graphs of High Minimum Degree 👍 👎

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 Q4848784)