A bound on the total chromatic number
From MaRDI portal
Publication:1297726
DOI10.1007/PL00009820zbMath0921.05033WikidataQ28109439 ScholiaQ28109439MaRDI QIDQ1297726
Michael S. O. Molloy, Bruce A. Reed
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
05C15: Coloring of graphs and hypergraphs
Related Items
Concentration of non‐Lipschitz functions and applications, The adjacent vertex distinguishing total chromatic number, Fractional total colourings of graphs of high girth, \([r,s,t\)-colorings of graphs], Asymptotically optimal frugal colouring, A strengthening of Brooks' theorem, \((2,1)\)-total labelling of outerplanar graphs, \((p,1)\)-total labelling of graphs, Total chromatic number of planar graphs with maximum degree ten