Improper Colourings of Unit Disk Graphs. - Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni (Electron. Notes Discret. Math., 2005)

Acyclic dominating partitions. - Louigi Addario-Berry; Ross J. Kang (Electron. Notes Discret. Math., 2007)

The t-improper chromatic number of random graphs. - Ross J. Kang; Colin J. H. McDiarmid (Electron. Notes Discret. Math., 2007)

Improper colouring of (random) unit disk graphs. - Ross J. Kang; Tobias Müller 001; Jean-Sébastien Sereni (Discret. Math., 2008)

Improper colourings of graphs. - Ross J. Kang (2008)

Acyclic and Frugal Colourings of Graphs. - Ross J. Kang; Tobias Müller 001 (CTW, 2009)

Circular choosability. - Frédéric Havet; Ross J. Kang; Tobias Müller 001; Jean-Sébastien Sereni (J. Graph Theory, 2009)

Improper coloring of unit disk graphs. - Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni (Networks, 2009)

Dot Product Representations of Planar Graphs. - Ross J. Kang; Tobias Müller 001 (GD, 2010)

The t-Stability Number of a Random Graph. - Nikolaos Fountoulakis; Ross J. Kang; Colin McDiarmid (Electron. J. Comb., 2010)

The t-Improper Chromatic Number of Random Graphs. - Ross J. Kang; Colin McDiarmid (Comb. Probab. Comput., 2010)

Acyclic improper colourings of graphs with bounded maximum degree. - Louigi Addario-Berry; Louis Esperet; Ross J. Kang; Colin J. H. McDiarmid; Alexandre Pinlou (Discret. Math., 2010)

Acyclic dominating partitions. - Louigi Addario-Berry; Ross J. Kang; Tobias Müller 001 (J. Graph Theory, 2010)

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. - Magnus Bordewich; Ross J. Kang (ICALP (1), 2011)

Dot Product Representations of Planar Graphs. - Ross J. Kang; László Lovász 001; Tobias Müller 001; Edward R. Scheinerman (Electron. J. Comb., 2011)

Frugal, acyclic and star colourings of graphs. - Ross J. Kang; Tobias Müller 001 (Discret. Appl. Math., 2011)

Largest sparse subgraphs of random graphs. - Nikolaos Fountoulakis; Ross J. Kang; Colin McDiarmid (Electron. Notes Discret. Math., 2011)

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. - Ross J. Kang; Jean-Sébastien Sereni; Matej Stehlík (SIAM J. Discret. Math., 2011)

Distance edge-colourings and matchings. - Ross J. Kang; Putra Manggala (Discret. Appl. Math., 2012)

Sphere and Dot Product Representations of Graphs. - Ross J. Kang; Tobias Müller 001 (Discret. Comput. Geom., 2012)

Induced Matchings in Subcubic Planar Graphs. - Ross J. Kang; Matthias Mnich; Tobias Müller 001 (SIAM J. Discret. Math., 2012)

Improper Choosability and Property B. - Ross J. Kang (J. Graph Theory, 2013)

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. - Magnus Bordewich; Ross J. Kang (Electron. J. Comb., 2014)

The Distance-t Chromatic Index of Graphs. - Tomás Kaiser; Ross J. Kang (Comb. Probab. Comput., 2014)

Arrangements of Pseudocircles and Circles. - Ross J. Kang; Tobias Müller 001 (Discret. Comput. Geom., 2014)

Supersaturation in the Boolean Lattice. - Andrew P. Dove; Jerrold R. Griggs; Ross J. Kang; Jean-Sébastien Sereni (Integers, 2014)

For most graphs H, most H-free graphs have a linear homogeneous set. - Ross J. Kang; Colin McDiarmid; Bruce A. Reed; Alex D. Scott (Random Struct. Algorithms, 2014)

On r-dynamic coloring of grids. - Ross J. Kang; Tobias Müller 001; Douglas B. West (Discret. Appl. Math., 2015)

Decomposition of bounded degree graphs into C4-free subgraphs. - Ross J. Kang; Guillem Perarnau (Eur. J. Comb., 2015)

On a Ramsey-type problem of Erdős and Pach. - Ross J. Kang; Viresh Patel; Guus Regts (Electron. Notes Discret. Math., 2015)

A Precise Threshold for Quasi-Ramsey Numbers. - Ross J. Kang; János Pach; Viresh Patel; Guus Regts (SIAM J. Discret. Math., 2015)

Squared chromatic and stability numbers without claws or large cliques. - Wouter Cames van Batenburg; Ross J. Kang (CoRR, 2016)

Coloring Powers and Girth. - Ross J. Kang; François Pirot (SIAM J. Discret. Math., 2016)

Packing two graphs of even girth 10. - Wouter Cames van Batenburg; Ross J. Kang (Electron. Notes Discret. Math., 2017)

Distance colouring without one cycle length. - Ross J. Kang; François Pirot (Electron. Notes Discret. Math., 2017)

Colouring squares of claw-free graphs. - Rémi de Joannis de Verclos; Ross J. Kang; Lucas Pastor (Electron. Notes Discret. Math., 2017)

List Coloring with a Bounded Palette. - Marthe Bonamy; Ross J. Kang (J. Graph Theory, 2017)

Extension from Precoloured Sets of Edges. - Katherine Edwards; António Girão; Jan van den Heuvel; Ross J. Kang; Gregory J. Puleo; Jean-Sébastien Sereni (Electron. J. Comb., 2018)

Least conflict choosability. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (CoRR, 2018)

Colouring triangle-free graphs with local list sizes. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (CoRR, 2018)

Packing Graphs of Bounded Codegree. - Wouter Cames van Batenburg; Ross J. Kang (Comb. Probab. Comput., 2018)

Approximate Strong Edge-Colouring of Unit Disk Graphs. - Nicolas Grelier; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (WAOA, 2019)

VC Dimension and a Union Theorem for Set Systems. - Stijn Cambie; António Girão; Ross J. Kang (Electron. J. Comb., 2019)

Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth. - Ross J. Kang; Willem van Loon (Electron. J. Comb., 2019)

Separation Choosability and Dense Bipartite Induced Subgraphs. - Louis Esperet; Ross J. Kang; Stéphan Thomassé (Comb. Probab. Comput., 2019)

A precolouring extension of Vizing's theorem. - António Girão; Ross J. Kang (J. Graph Theory, 2019)

Bipartite Induced Density in Triangle-Free Graphs. - Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (Electron. J. Comb., 2020)

An algorithmic framework for colouring locally sparse graphs. - Ewan Davies; Ross J. Kang; François Pirot; Jean-Sébastien Sereni (CoRR, 2020)

Coloring triangle-free graphs with local list sizes. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (Random Struct. Algorithms, 2020)

An improved procedure for colouring graphs of bounded local density. - Eoin Hurley; Rémi de Joannis de Verclos; Ross J. Kang (SODA, 2021)

Structure and Colour in Triangle-Free Graphs. - N. R. Aravind; Stijn Cambie; Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang; Viresh Patel (Electron. J. Comb., 2021)

Packing list-colourings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (CoRR, 2021)

Occupancy fraction, fractional colouring, and triangle fraction. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (J. Graph Theory, 2021)

Single-conflict colouring. - Zdenek Dvorák 001; Louis Esperet; Ross J. Kang; Kenta Ozeki (J. Graph Theory, 2021)

Strong chromatic index and Hadwiger number. - Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (J. Graph Theory, 2022)

Colorings, transversals, and local sparsity. - Ross J. Kang; Tom Kelly 001 (Random Struct. Algorithms, 2022)

Maximizing Line Subgraphs of Diameter at Most t. - Stijn Cambie; Wouter Cames van Batenburg; Rémi de Joannis de Verclos; Ross J. Kang (SIAM J. Discret. Math., 2022)

The χ-binding function of d-directional segment graphs. - Lech Duraj; Ross J. Kang; Hoang La; Jonathan Narboni; Filip Pokrývka; Clément Rambaud; Amadeus Reinald (CoRR, 2023)

Regular Turán numbers and some Gan-Loh-Sudakov-type problems. - Stijn Cambie; Rémi de Joannis de Verclos; Ross J. Kang (J. Graph Theory, 2023)

Reconfiguration of Independent Transversals. - Pjotr Buys; Ross J. Kang; Kenta Ozeki (CoRR, 2024)

Largest component in Boolean sublattices. - Julian Galliano; Ross J. Kang (CoRR, 2024)

List packing number of bounded degree graphs. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Comb. Probab. Comput., 2024)

A Precise Condition for Independent Transversals in Bipartite Covers. - Stijn Cambie; Penny Haxell; Ross J. Kang; Ronen Wdowinski (SIAM J. Discret. Math., 2024)

When removing an independent set is optimal for reducing the chromatic number. - Stijn Cambie; John Haslegrave; Ross J. Kang (Eur. J. Comb., 2024)

Packing list-colorings. - Stijn Cambie; Wouter Cames van Batenburg; Ewan Davies; Ross J. Kang (Random Struct. Algorithms, 2024)

The hard-core model in graph theory. - Ewan Davies; Ross J. Kang (CoRR, 2025)

Triangle-free graphs with the fewest independent sets. - Pjotr Buys; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)

Reconfiguration of List Colourings. - Stijn Cambie; Wouter Cames van Batenburg; Daniel W. Cranston; Jan van den Heuvel; Ross J. Kang (CoRR, 2025)