On total colourings of graphs

DOI10.1006/jctb.1993.1010zbMath0725.05036OpenAlexW2028966195MaRDI QIDQ2277476

Colin J. H. McDiarmid, Bruce A. Reed

Publication date: 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1010

zbMATH Keywords

random graphtotal colouring

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Randomly colouring graphs (a combinatorial view) ⋮ \((p,1)\)-total labelling of graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Recent results on the total chromatic number ⋮ An upper bound for total colouring of graphs ⋮ Fractionally total colouring \(G_{n,p}\) ⋮ A new upper bound for total colourings of graphs ⋮ Recent developments in total colouring ⋮ Some colouring problems for Paley graphs

This page was built for publication: On total colourings of graphs