Richard Lang

List Edge-Coloring and Total Coloring in Graphs of Low Treewidth

We prove that the list chromatic index of a graph of maximum degree Δ and treewidth i¾?2Δ-3 is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth i¾?Δ/3+1 is Δ+1. This improves results by Meeks and Scott.

Almost Partitioning a 3-Edge-Colored

We show that for any colouring of the edges of the complete bipartite graph

K_{n,n}

K_{n,n}

into Five Monochromatic Cycles

with 3 colours there are 5 disjoint monochromatic cycles which together cover all but

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

o(n)

Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles

of the vertices. In the same situation, 18 disjoint monochromatic cycles together cover all vertices.

Local colourings and monochromatic partitions in complete bipartite graphs

It is shown that Halin graphs are

Estimating the distance to a hereditary graph property

\varDelta