The total chromatic number of complete multipartite graphs with low deficiency
From MaRDI portal
Publication:897273
DOI10.1007/S00373-014-1503-4zbMATH Open1330.05062OpenAlexW2030247046MaRDI QIDQ897273FDOQ897273
Authors: Aseem Dalal, C. A. Rodger 
Publication date: 17 December 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1503-4
Recommendations
- scientific article; zbMATH DE number 1146233
- The chromaticity of certain complete multipartite graphs
- Total chromatic number of completer-partite graphs
- The total chromatic number of nearly complete bipartite graphs
- The chromatic index of complete multipartite graphs
- scientific article; zbMATH DE number 4085672
- The total chromatic number of regular graphs whose complement is bipartite
- scientific article; zbMATH DE number 169493
- The total chromatic number of some bipartite graphs
- The Total Chromatic Number of Graphs of High Minimum Degree
Cites Work
- Class one graphs
- Hamilton decompositions of complete graphs with a 3-factor leave.
- Total Colourings of Graphs
- Title not available (Why is that?)
- The chromatic index of complete multipartite graphs
- Total chromatic number of completer-partite graphs
- Nombre Chromatique Total Du Graphe R -Parti Complet
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Canonical edge-colourings of locally finite graphs
Cited In (6)
This page was built for publication: The total chromatic number of complete multipartite graphs with low deficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897273)
