On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three

被引：8
|
作者：
Fouquet, J. -L. [1 ]
Vanherpe, J. -M. [1 ]
机构：
[1] Univ Orleans, Fac Sci, LIFO, F-45067 Orleans 2, France
来源：
GRAPHS AND COMBINATORICS | 2013年 / 29卷 / 03期
关键词：
Cubic graph; Edge-colouring; SUBGRAPHS;
D O I：
10.1007/s00373-012-1145-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In a graph G of maximum degree Delta, let gamma denote the largest fraction of edges that can be Delta edge-coloured. Albertson and Haas showed that when G is cubic. We show here that this result can be extended to graphs with maximum degree 3, with the exception of a graph on 5 vertices. Moreover, there are exactly two graphs with maximum degree 3 (one being obviously the Petersen graph) for which This extends a result given by Steffen. These results are obtained by using structural properties of the so called delta-minimum edge colourings for graphs with maximum degree 3.
引用
收藏
页码：475 / 487
页数：13
相关论文
共 50 条
  • [41] Small independent edge dominating sets in graphs of maximum degree three
    Zwoiniak, GY
    SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 556 - 564
  • [42] Randomly colouring graphs with lower bounds on girth and maximum degree
    Dyer, M
    Frieze, A
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 579 - 587
  • [43] Colouring graphs when the number of colours is almost the maximum degree
    Molloy, Michael
    Reed, Bruce
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 109 : 134 - 195
  • [44] Randomly colouring graphs with girth five and large maximum degree
    Lau, LC
    Molloy, M
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 665 - 676
  • [45] The neighbour-sum-distinguishing edge-colouring game
    Baudon, Olivier
    Przybylo, Jakub
    Senhaji, Mohammed
    Sidorowicz, Elzbieta
    Sopena, Eric
    Wozniak, Mariusz
    DISCRETE MATHEMATICS, 2017, 340 (07) : 1564 - 1572
  • [46] Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
    Dvorak, Zdenek
    Lahiri, Abhiruk
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2023, 2023, 14093 : 291 - 304
  • [47] Three-edge-colouring doublecross cubic graphs
    Edwards, Katherine
    Sanders, Daniel P.
    Seymour, Paul
    Thomas, Robin
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 119 : 66 - 95
  • [48] Rotation sequences and edge-colouring of binary tree pairs
    Gibbons, A
    Sant, P
    THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 409 - 418
  • [49] On the edge colouring of bipartite graphs
    Magomedov, A. M.
    DISCRETE MATHEMATICS AND APPLICATIONS, 2009, 19 (01): : 81 - 87
  • [50] Edge density and independence ratio in triangle-free graphs with maximum degree three
    Griggs, J
    Murphy, O
    DISCRETE MATHEMATICS, 1996, 152 (1-3) : 157 - 170
12345