A bound on the total chromatic number
From MaRDI portal
Publication:1297726
DOI10.1007/PL00009820zbMATH Open0921.05033WikidataQ28109439 ScholiaQ28109439MaRDI QIDQ1297726FDOQ1297726
Authors: Michael Molloy, Bruce Reed 
Publication date: 14 September 1999
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
- An upper bound for the total chromatic number
- scientific article; zbMATH DE number 861441
- A tight bound on the set chromatic number
- Bounds for the chromatic number of a graph
- Bounds on the distinguishing chromatic number
- A lower bound for the chromatic number of a graph
- scientific article; zbMATH DE number 4085672
- Some bounds for the \(b\)-chromatic number of a graph
- Bounds to the chromatic polynomial of a graph
- Algorithmic bounds for the chromatic number†
Cited In (48)
- \((p,1)\)-total labelling of graphs
- Semi-total graph colourings, the beta parameter, and total chromatic number
- An upper bound for the total chromatic number of dense graphs
- Some results on total chromatic number of a graph
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs
- On the coequal values of total chromatic number and chromatic index
- Title not available (Why is that?)
- 2-distance vertex-distinguishing total coloring of graphs
- An upper bound for total colouring of graphs
- Total colorings-a survey
- Fractional total colourings of graphs of high girth
- A new upper bound for total colourings of graphs
- A note on asymptotically optimal neighbour sum distinguishing colourings
- Title not available (Why is that?)
- Hadwiger's conjecture for squares of 2-trees
- An Improvement of Hind's Upper Bound on the Total Chromatic Number
- On graphs with linear Ramsey numbers
- Randomly colouring graphs (a combinatorial view)
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Inclusion total chromatic number
- Title not available (Why is that?)
- Efficiently list‐edge coloring multigraphs asymptotically optimally
- The adjacent vertex distinguishing total chromatic number
- Some bounds on the generalised total chromatic number of degenerate graphs
- An upper bound of star-edge-star total chromatic number of graphs
- \((\mathcal{P},\mathcal{Q})\)-total \((r,s)\)-colorings of graphs
- Acyclic coloring of graphs and entropy compression method
- On the chromatic number of powers of subdivisions of graphs
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- A strengthening of Brooks' theorem
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- Title not available (Why is that?)
- Total-coloring of sparse graphs with maximum degree 6
- Concentration of non‐Lipschitz functions and applications
- On bounding the chromatic number of L-graphs
- \([r,s,t]\)-colorings of graphs
- Total chromatic number of planar graphs with maximum degree ten
- Asymptotically optimal frugal colouring
- A stronger bound for the strong chromatic index
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- List edge-coloring and total coloring in graphs of low treewidth
- A survey of graph coloring -- its types, methods and applications
- Total Thue colourings of graphs
- Title not available (Why is that?)
- Total coloring of some graph operations
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
- Distant set distinguishing total colourings of graphs
- \((2,1)\)-total labelling of outerplanar graphs
This page was built for publication: A bound on the total chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1297726)
