On total chromatic number of complete multipartite graphs
From MaRDI portal
Publication:6547837
DOI10.1007/978-3-031-52213-0_19MaRDI QIDQ6547837
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
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?)
- 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
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
- 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
- Cycle decompositions of complete multigraphs
This page was built for publication: On total chromatic number of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547837)
