Nombre Chromatique Total Du Graphe R -Parti Complet
From MaRDI portal
Publication:4044597
Cited in
(15)- Adjacent strong edge colorings and total colorings of regular graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- Total-colorings of complete multipartite graphs using amalgamations
- The total chromatic number of some bipartite graphs
- Recent developments in total colouring
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- On total chromatic number of complete multipartite graphs
- Nombre chromatique total du joint d'un ensemble stable par un cycle
- An upper bound for the total chromatic number
- The total chromatic number of complete multipartite graphs with low deficiency
- Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
- Total colorings of complete multipartite graphs using amalgamations
- Generalization of two results of Hilton on total-colourings of a graph
- Some coloring numbers for complete r-partite graphs
- Nombre chromatique total d'un hypergraphe
This page was built for publication: Nombre Chromatique Total Du Graphe R -Parti Complet
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044597)