Advertisement

Combinatorica

, Volume 13, Issue 4, pp 435–440 | Cite as

Fractionally colouring total graphs

  • K. Kilakos
  • B. Reed
Article

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 graphG, 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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Behzad: Graphs and their chromatic numbers,Doctoral Thesis (Michigan State University)., (1965).Google Scholar
  2. [2]
    J. Edmonds: Maximum matching and a polyhedron with 0,1 vertices,Journal of Research of the National Bureau of Standards (B) 69 (1965), 125–130.Google Scholar
  3. [3]
    D. R. Fulkerson: Anti-blocking polyhedra,J. Combinatorial Theory B 12 (1972). 50–71.Google Scholar
  4. [4]
    H. R. Hind: An upper bound on the total chromatic number.,Graphs and Combinatorics 6 (1990), 153–158.Google Scholar
  5. [5]
    J. Ryan: Fractional total colouring,Discrete Appl. Math. 27 (1990), 287–292.Google Scholar
  6. [6]
    N. Vijayaditya: On the total chromatic number of a graph,J. London Math. Soc. (2)3 (1971), 405–408.Google Scholar
  7. [7]
    V. G. Vizing: Some unsolved problems in graph theory (in Russian),Uspekhi Math. Nauk. 23 (1968), 117–134.Google Scholar

Copyright information

© Akadémiai Kiadó 1993

Authors and Affiliations

  • K. Kilakos
    • 1
  • B. Reed
    • 2
  1. 1.Dept de Mathématique et d'InformatiqueUniversitá du Quebéc à montréalCanada
  2. 2.Department of MathematicsCarnegie Mellon UniversityUSA

Personalised recommendations