Richard Lang

Orcid: 0000-0002-7661-934X

According to our database1, Richard Lang authored at least 17 papers between 1989 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Sufficient conditions for perfect mixed tilings.
J. Comb. Theory B, 2025

2024
Edge-colouring graphs with local list sizes.
J. Comb. Theory B, March, 2024

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.
Eur. J. Comb., 2024

2023
An Improved Bound for the Linear Arboricity Conjecture.
Comb., June, 2023

Resilience for loose Hamilton cycles.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2021
On the Query Complexity of Estimating the Distance to Hereditary Graph Properties.
SIAM J. Discret. Math., 2021

Minimum degree conditions for monochromatic cycle partitioning.
J. Comb. Theory B, 2021

Monochromatic cycle partitions in random graphs.
Comb. Probab. Comput., 2021

2020
Estimating parameters associated with monotone properties.
Comb. Probab. Comput., 2020

2017
Almost Partitioning a 3-Edge-Colored K<sub>n, n</sub> into Five Monochromatic Cycles.
SIAM J. Discret. Math., 2017

Estimating the distance to a hereditary graph property.
Electron. Notes Discret. Math., 2017

2016
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth.
J. Graph Theory, 2016

A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3.
Graphs Comb., 2016

Chromatic index, treewidth and maximum degree.
Electron. Notes Discret. Math., 2016

2015
Partitioning 3-edge-coloured complete bipartite graphs into monochromatic cycles.
Electron. Notes Discret. Math., 2015

Local colourings and monochromatic partitions in complete bipartite graphs.
Electron. Notes Discret. Math., 2015

1989
The Ninth World Microcomputer Chess Championship.
J. Int. Comput. Games Assoc., 1989


  Loading...