A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3

被引：0

作者：

Lang, Richard ^{[1
]}

机构：

[1] Univ Chile, Dept Ingn Matemat, Blanco Encalada 2120, Santiago, Chile

来源：

GRAPHS AND COMBINATORICS | 2016年 / 32卷 / 03期

关键词：

List edge-coloring; Total coloring; Halin graphs; Tree-width; 3; MULTIGRAPH;

D O I：

10.1007/s00373-015-1617-3

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

It is shown that Halin graphs are -edge-choosable and that graphs of tree-width 3 are -edge-choosable and -total-colourable.

引用

页码：1055 / 1064

页数：10

共 16 条

[1]

Alon N., 1993, LONDON MATH SOC LECT, V187

[2]

Behzad M., 1963, THESIS MICHIGAN STAT

[3]

Bodlaender H. L., 1988, RUUCS8814 U UTR DEP

[4] A partial k-arboretum of graphs with bounded treewidth [J].

Bodlaender, HL .

THEORETICAL COMPUTER SCIENCE, 1998, 209 (1-2) :1-45

[5] LIST-COLOURINGS OF GRAPHS [J].

BOLLOBAS, B ;

HARRIS, AJ .

GRAPHS AND COMBINATORICS, 1985, 1 (02) :115-127

[6] 92.80 The edge-choosability of the tetrahedron [J].

Cariolaro, David ;

Lih, Ko-Wei .

MATHEMATICAL GAZETTE, 2008, 92 (525) :543-546

[7]

Diestel R., 2010, GRAPH THEORY, V4

[8] List edge colourings of some 1-factorable multigraphs [J].

Ellingham, MN ;

Goddyn, L .

COMBINATORICA, 1996, 16 (03) :343-352

[9] THE LIST CHROMATIC INDEX OF A BIPARTITE MULTIGRAPH [J].

GALVIN, F .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1995, 63 (01) :153-158

[10]

Jensen T., 1995, Graph Coloring Problems, P115

← 1 2 →