Nombre Chromatique Total Du Graphe R -Parti Complet

DOI10.1112/JLMS/S2-9.2.279MaRDI QIDQ4044597zbMATH OpenOpenAlexFDO

Authors Jean-Claude Bermond

Publication date 1974

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-02366538/file/8-Ber74b-total-rparti.pdf

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(17)

• Adjacent strong edge colorings and total colorings of regular graphs
• Some coloring numbers for complete r-partite graphs
• Nombre chromatique total d'un hypergraphe
• Nombre chromatique total du joint d'un ensemble stable par un cycle
• Recent developments in total colouring
• Generalization of two results of Hilton on total-colourings of a graph
• Equitable total chromatic number of \(K_{r \times p}\) for \(p\) even
• An upper bound for the total chromatic number
• Equitable total coloring of complete $r$-partite $p$-balanced 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
• On total chromatic number of complete multipartite graphs
• Total colorings of complete multipartite graphs using amalgamations
• A sufficient condition for complete multipartite graphs to be of type 1
• On total chromatic number of complete multipartite graphs
• The total chromatic number of complete multipartite graphs with low deficiency

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)