scientific article; zbMATH DE number 798659

MaRDI QIDQ4848784zbMATH OpenFDO

Authors

Publication date 5 March 1996

zbMATH Keywords

maximum degreetotal chromatic number

Mathematics Subject Classification ID

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

Recommendations

• The total chromatic number of graphs having large maximum degree
• A bound on the total chromatic number
• scientific article; zbMATH DE number 4150186
• The total chromatic number of graphs of even order and high degree
• The Total Chromatic Number of Graphs of High Minimum Degree

Cited in

(17)

• Semi-total graph colourings, the beta parameter, and total chromatic number
• Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable
• 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
• scientific article; zbMATH DE number 4150186 (Why is no real title available?)
• Total chromatic number of regular graphs of odd order and high degree
• Graphs with chromatic number close to maximum degree
• The total chromatic number of regular graphs of high degree
• The chromatic index of graphs of high maximum degree
• scientific article; zbMATH DE number 98760 (Why is no real title available?)
• Total Thue colourings of graphs
• scientific article; zbMATH DE number 62433 (Why is no real title available?)

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)