A bound on the total chromatic number
From MaRDI portal
Publication:1297726
DOI10.1007/PL00009820zbMath0921.05033WikidataQ28109439 ScholiaQ28109439MaRDI QIDQ1297726
Bruce A. Reed, Michael S. O. Molloy
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
Related Items (30)
Concentration of non‐Lipschitz functions and applications ⋮ Asymptotically optimal neighbor sum distinguishing total colorings of graphs ⋮ Distant set distinguishing total colourings of graphs ⋮ Hadwiger's conjecture for squares of 2-trees ⋮ \([r,s,t\)-colorings of graphs] ⋮ Efficiently list‐edge coloring multigraphs asymptotically optimally ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Total colorings-a survey ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ The adjacent vertex distinguishing total chromatic number ⋮ A survey of graph coloring - its types, methods and applications ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Fractional total colourings of graphs of high girth ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ 2-distance vertex-distinguishing total coloring of graphs ⋮ \((2,1)\)-total labelling of outerplanar graphs ⋮ \((p,1)\)-total labelling of graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Asymptotically optimal frugal colouring ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ List Edge-Coloring and Total Coloring in Graphs of Low Treewidth ⋮ Inclusion total chromatic number ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Total chromatic number of planar graphs with maximum degree ten ⋮ A strengthening of Brooks' theorem ⋮ On the coequal values of total chromatic number and chromatic index ⋮ \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs
This page was built for publication: A bound on the total chromatic number
