The adjacent vertex distinguishing total chromatic number
Authors:
- Tom CokerTCTom Coker
- Karen JohannsonKJKaren Johannson
- 1 September 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (17) , 2741-2750
Abstract
No abstract availableAll Related Versions
This publication has 13 references indexed in Scilit:
- Concise proofs for adjacent vertex-distinguishing total coloringsDiscrete Mathematics, 2009
- On the adjacent vertex distinguishing total coloring numbers of graphs withDiscrete Mathematics, 2008
- Adjacent Vertex Distinguishing Edge‐ColoringsSIAM Journal on Discrete Mathematics, 2007
- Concentration for self‐bounding functions and an inequality of TalagrandRandom Structures & Algorithms, 2006
- is a bound on the adjacent vertex distinguishing edge chromatic numberJournal of Combinatorial Theory, Series B, 2005
- A Bound on the Total Chromatic NumberCombinatorica, 1998
- Vertex-distinguishing proper edge-coloringsJournal of Graph Theory, 1997
- New concentration inequalities in product spacesInventiones Mathematicae, 1996
- Concentration of measure and isoperimetric inequalities in product spacesPublications mathématiques de l'IHÉS, 1995
- SOME UNSOLVED PROBLEMS IN GRAPH THEORYRussian Mathematical Surveys, 1968