Fractionally colouring total graphs Article Received: 29 October 1990 DOI:
Cite this article as: Kilakos, K. & Reed, B. Combinatorica (1993) 13: 435. doi:10.1007/BF01303515 Abstract
Bchzad and Vizing have conjectured that given any simple graph of maximum degree Δ, one can colour its edges and vertices with Δ+2 colours so that no two adjacent vertices, or two incident edges, or an edge and either of its ends receive the same colour. We show that for any simple graph
G, V(G)ϒ E(G) can be fractionally coloured with Δ+2 colours. AMS subject classification codes (1991) 05 C 15 05 C 70 90 C 10 References
M. Behzad: Graphs and their chromatic numbers, Doctoral Thesis (Michigan State University)., (1965).
: Maximum matching and a polyhedron with 0,1 vertices,
Journal of Research of the National Bureau of Standards (B)
D. R. Fulkerson
: Anti-blocking polyhedra,
J. Combinatorial Theory B
H. R. Hind
: An upper bound on the total chromatic number.,
Graphs and Combinatorics
: Fractional total colouring,
Discrete Appl. Math.
: On the total chromatic number of a graph,
J. London Math. Soc.
V. G. Vizing
: Some unsolved problems in graph theory (in Russian),
Uspekhi Math. Nauk.