, Volume 13, Issue 4, pp 435-440

Fractionally colouring total graphs

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.