R. Lang

activity

20132023

most citedEstimating parameters associated with monotone properties

5 citations · 21 across the 17 of their papers we have counts for

collaborators

Showing 2015Show all

4 papers · 1 filter

math.CO2015★ 1 cited

Almost partitioning a 3-edge-coloured $K_{n, n}$ into 5 monochromatic cycles

Richard Lang, Oliver Schaudt, Maya Stein

We show that for any colouring of the edges of the complete bipartite graph $K_{n, n}$ with 3 colours there are 5 disjoint monochromatic cycles which together cover all but $o (n)$ o…

math.CO2015★ 1 cited

On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7

Richard Lang

Among other results, it is shown that 3-trees are $Δ$ -edge-choosable and that graphs of tree-width 3 and maximum degree at least 7 are $Δ$ -edge-choosable.

math.CO2015

A note on total and list edge-colouring of graphs of tree-width 3

Richard Lang

It is shown that Halin graphs are $Δ$ -edge-choosable and that graphs of tree-width 3 are $(Δ + 1)$ -edge-choosable and $(Δ + 2)$ -total-colourable.

math.CO2015★ 4 cited

Local colourings and monochromatic partitions in complete bipartite graphs

Richard Lang, Maya Stein

We show that for any $2$ -local colouring of the edges of the balanced complete bipartite graph $K_{n, n}$ , its vertices can be covered with at most~ $3$ disjoint monochromatic paths.…

Almost partitioning a 3-edge-coloured Kn,n​ into 5 monochromatic cycles

On the list chromatic index of graphs of tree-width 3 and maximum degree at least 7

A note on total and list edge-colouring of graphs of tree-width 3

Local colourings and monochromatic partitions in complete bipartite graphs

Almost partitioning a 3-edge-coloured $K_{n, n}$ into 5 monochromatic cycles