Total-colorings of complete multipartite graphs using amalgamations
From MaRDI portal
Publication:271641
DOI10.1016/j.disc.2015.12.032zbMath1333.05104OpenAlexW2267406273MaRDI QIDQ271641
C. A. Rodger, B. S. Panda, Aseem Dalal
Publication date: 7 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.032
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total chromatic number of unichord-free graphs
- The total chromatic number of complete multipartite graphs with low deficiency
- Class one graphs
- The total chromatic number of graphs of even order and high degree
- Hamilton decompositions of complete graphs with a 3-factor leave.
- 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
- Cycle decompositions of complete multigraphs
This page was built for publication: Total-colorings of complete multipartite graphs using amalgamations