The total chromatic number of complete multipartite graphs with low deficiency
From MaRDI portal
Publication:897273
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
- scientific article; zbMATH DE number 4108788 (Why is no real title available?)
- scientific article; zbMATH DE number 1146233 (Why is no real title available?)
- scientific article; zbMATH DE number 1416070 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- Canonical edge-colourings of locally finite graphs
- Class one graphs
- Hamilton decompositions of complete graphs with a 3-factor leave.
- Nombre Chromatique Total Du Graphe R -Parti Complet
- The chromatic index of complete multipartite graphs
- Total Colourings of Graphs
- Total chromatic number of completer-partite graphs
Cited in
(6)- Total colorings-a survey
- Total-colorings of complete multipartite graphs using amalgamations
- On total chromatic number of complete multipartite graphs
- scientific article; zbMATH DE number 169493 (Why is no real title available?)
- scientific article; zbMATH DE number 1416070 (Why is no real title available?)
- Total colorings of complete multipartite graphs using amalgamations
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)