Ross J. Kang

According to our database1, Ross J. Kang authored at least 53 papers between 2005 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Coloring triangle-free graphs with local list sizes.
Random Struct. Algorithms, 2020

An improved procedure for colouring graphs of bounded local density.
CoRR, 2020

An algorithmic framework for colouring locally sparse graphs.
CoRR, 2020

Bipartite Induced Density in Triangle-Free Graphs.
Electron. J. Comb., 2020

2019
A precolouring extension of Vizing's theorem.
J. Graph Theory, 2019

Separation Choosability and Dense Bipartite Induced Subgraphs.
Comb. Probab. Comput., 2019

Structure and colour in triangle-free graphs.
CoRR, 2019

Strong chromatic index and Hadwiger number.
CoRR, 2019

Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth.
Electron. J. Comb., 2019

VC Dimension and a Union Theorem for Set Systems.
Electron. J. Comb., 2019

Approximate Strong Edge-Colouring of Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2018
Packing Graphs of Bounded Codegree.
Comb. Probab. Comput., 2018

Occupancy fraction, fractional colouring, and triangle fraction.
CoRR, 2018

Colouring triangle-free graphs with local list sizes.
CoRR, 2018

Least conflict choosability.
CoRR, 2018

Extension from Precoloured Sets of Edges.
Electron. J. Comb., 2018

2017
List Coloring with a Bounded Palette.
J. Graph Theory, 2017

Colouring squares of claw-free graphs.
Electron. Notes Discret. Math., 2017

Distance colouring without one cycle length.
Electron. Notes Discret. Math., 2017

Packing two graphs of even girth 10.
Electron. Notes Discret. Math., 2017

2016
Coloring Powers and Girth.
SIAM J. Discret. Math., 2016

Squared chromatic and stability numbers without claws or large cliques.
CoRR, 2016

2015
A Precise Threshold for Quasi-Ramsey Numbers.
SIAM J. Discret. Math., 2015

On a Ramsey-type problem of Erdős and Pach.
Electron. Notes Discret. Math., 2015

Decomposition of bounded degree graphs into C<sub>4</sub>-free subgraphs.
Eur. J. Comb., 2015

On r-dynamic coloring of grids.
Discret. Appl. Math., 2015

2014
For most graphs <i>H</i>, most <i>H</i>-free graphs have a linear homogeneous set.
Random Struct. Algorithms, 2014

Supersaturation in the Boolean Lattice.
Integers, 2014

Arrangements of Pseudocircles and Circles.
Discret. Comput. Geom., 2014

The Distance-<i>t</i> Chromatic Index of Graphs.
Comb. Probab. Comput., 2014

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width.
Electron. J. Comb., 2014

2013
Improper Choosability and Property B.
J. Graph Theory, 2013

2012
Induced Matchings in Subcubic Planar Graphs.
SIAM J. Discret. Math., 2012

Sphere and Dot Product Representations of Graphs.
Discret. Comput. Geom., 2012

2011
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring.
SIAM J. Discret. Math., 2011

Largest sparse subgraphs of random graphs.
Electron. Notes Discret. Math., 2011

Frugal, acyclic and star colourings of graphs.
Discret. Appl. Math., 2011

Dot Product Representations of Planar Graphs.
Electron. J. Comb., 2011

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Acyclic dominating partitions.
J. Graph Theory, 2010

Acyclic improper colourings of graphs with bounded maximum degree.
Discret. Math., 2010

The <i>t</i>-Improper Chromatic Number of Random Graphs.
Comb. Probab. Comput., 2010

The t-Stability Number of a Random Graph.
Electron. J. Comb., 2010

Dot Product Representations of Planar Graphs.
Proceedings of the Graph Drawing - 18th International Symposium, GD 2010, Konstanz, 2010

2009
Improper coloring of unit disk graphs.
Networks, 2009

Circular choosability.
J. Graph Theory, 2009

On distance edge-colourings and matchings.
Electron. Notes Discret. Math., 2009

Acyclic and Frugal Colourings of Graphs.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Improper colourings of graphs.
PhD thesis, 2008

Improper colouring of (random) unit disk graphs.
Discret. Math., 2008

2007
The t-improper chromatic number of random graphs.
Electron. Notes Discret. Math., 2007

Acyclic dominating partitions.
Electron. Notes Discret. Math., 2007

2005
Improper Colourings of Unit Disk Graphs.
Electron. Notes Discret. Math., 2005


  Loading...