Total Coloring With $\Delta + \mbox\lowercasepoly(\log \Delta)$ Colors

DOI10.1137/S0097539795294578zbMath0917.05028WikidataQ56390746 ScholiaQ56390746MaRDI QIDQ4229408

Hugh Hind, Michael S. O. Molloy, Bruce A. Reed

Publication date: 22 February 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539795294578

zbMATH Keywords

algorithms; probabilistic method; total coloring

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Randomly colouring graphs (a combinatorial view), \(k\)-forested coloring of planar graphs with large girth, Frugal, acyclic and star colourings of graphs, \(k\)-forested choosability of planar graphs and sparse graphs, Asymptotically optimal frugal colouring