Total colorings of complete multipartite graphs using amalgamations

DOI10.1016/J.DAM.2024.07.050MaRDI QIDQ6633532

Aseem Dalal, B. S. Panda, C. A. Rodger

Publication date: 6 November 2024

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

zbMATH Keywords

total chromatic numbertotal coloringcomplete multipartite graphsgraph amalgamations

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Total-colorings of complete multipartite graphs using amalgamations
• A total-chromatic number analogue of Plantholt's theorem
• The total chromatic number of complete multipartite graphs with low deficiency
• Class one graphs
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• The total chromatic number of graphs of even order and high degree
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Multiply balanced edge colorings of multigraphs
• Total Colourings of Graphs
• The chromatic index of complete multipartite graphs
• Total chromatic number of completer-partite graphs
• Nombre Chromatique Total Du Graphe R -Parti Complet
• On A Particular Conference Scheduling Problem
• Cycle decompositions of complete multigraphs

This page was built for publication: Total colorings of complete multipartite graphs using amalgamations

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