Fractionally colouring total graphs |
| |
| Authors: | K Kilakos B Reed |
| |
| Institution: | (1) Dept de Mathématique et d'Informatique, Universitá du Quebéc à montréal, Canada;(2) Department of Mathematics, Carnegie Mellon University, USA |
| |
| 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. |
| |
| Keywords: | 05 C 15 05 C 70 90 C 10 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
