Strong edge colouring of subcubic graphs

被引：16

作者：

Hocquard, Herve ^{[1
]}

Valicov, Petru ^{[1
]}

机构：

[1] LaBRI Univ Bordeaux 1, F-33405 Talence, France

来源：

DISCRETE APPLIED MATHEMATICS | 2011年 / 159卷 / 15期

关键词：

Subcubic graphs; Maximum average degree; Strong edge colouring;

D O I：

10.1016/j.dam.2011.06.015

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A strong edge colouring of a graph G is a proper edge colouring such that every path of length 3 uses three colours. In this paper, we prove that every subcubic graph with maximum average degree strictly less than 1 (resp. 27/11, 13/5, 36/13) can be strong edge coloured with six (resp. seven, eight, nine) colours. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：1650 / 1657

页数：8