Informace o publikaci
Fractional total colourings of graphs of high girth
| Autoři | |
|---|---|
| Rok publikování | 2011 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| Citace | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2010.12.005 |
| Klíčová slova | Total colouring; Fractional total chromatic number |
| Popis | Reed conjectured that for every epsilon > 0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at most Delta + 1 + epsilon. We prove the conjecture for Delta = 3 and for even Delta >= 4 in the following stronger form: For each of these values of Delta. there exists g such that the fractional total chromatic number of any graph with maximum degree Delta and girth at least g is equal to Delta + 1. (C) 2011 Elsevier Inc. All rights reserved. |