default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoss J. Kang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j53]Stijn Cambie
, John Haslegrave, Ross J. Kang:
When removing an independent set is optimal for reducing the chromatic number. Eur. J. Comb. 115: 103781 (2024)- [j52]Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colorings. Random Struct. Algorithms 64(1): 62-93 (2024) - [j51]Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A Precise Condition for Independent Transversals in Bipartite Covers. SIAM J. Discret. Math. 38(2): 1451-1461 (2024) - [i19]Pjotr Buys, Ross J. Kang, Kenta Ozeki:
Reconfiguration of Independent Transversals. CoRR abs/2407.04367 (2024) - 2023
- [j50]Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang:
Regular Turán numbers and some Gan-Loh-Sudakov-type problems. J. Graph Theory 102(1): 67-85 (2023) - [i18]Stijn Cambie, Penny Haxell, Ross J. Kang, Ronen Wdowinski:
A precise condition for independent transversals in bipartite covers. CoRR abs/2308.14778 (2023) - [i17]Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald:
The χ-binding function of d-directional segment graphs. CoRR abs/2309.06072 (2023) - 2022
- [j49]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Strong chromatic index and Hadwiger number. J. Graph Theory 100(3): 435-457 (2022) - [j48]Ross J. Kang, Tom Kelly:
Colorings, transversals, and local sparsity. Random Struct. Algorithms 61(1): 173-192 (2022) - [j47]Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang:
Maximizing Line Subgraphs of Diameter at Most t. SIAM J. Discret. Math. 36(2): 939-950 (2022) - 2021
- [j46]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel:
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j45]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Single-conflict colouring. J. Graph Theory 97(1): 148-160 (2021) - [j44]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. J. Graph Theory 97(4): 557-568 (2021) - [c7]Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang:
An improved procedure for colouring graphs of bounded local density. SODA 2021: 135-148 - [i16]Stijn Cambie, Wouter Cames van Batenburg, Ewan Davies, Ross J. Kang:
Packing list-colourings. CoRR abs/2110.05230 (2021) - 2020
- [j43]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Bipartite Induced Density in Triangle-Free Graphs. Electron. J. Comb. 27(2): 2 (2020) - [j42]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Coloring triangle-free graphs with local list sizes. Random Struct. Algorithms 57(3): 730-744 (2020) - [i15]Ewan Davies, Ross J. Kang, François Pirot, Jean-Sébastien Sereni:
An algorithmic framework for colouring locally sparse graphs. CoRR abs/2004.07151 (2020) - [i14]Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang:
An improved procedure for colouring graphs of bounded local density. CoRR abs/2007.07874 (2020)
2010 – 2019
- 2019
- [j41]Ross J. Kang, Willem van Loon:
Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth. Electron. J. Comb. 26(1): 1 (2019) - [j40]Stijn Cambie, António Girão, Ross J. Kang:
VC Dimension and a Union Theorem for Set Systems. Electron. J. Comb. 26(3): 3 (2019) - [j39]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation Choosability and Dense Bipartite Induced Subgraphs. Comb. Probab. Comput. 28(5): 720-732 (2019) - [j38]António Girão, Ross J. Kang:
A precolouring extension of Vizing's theorem. J. Graph Theory 92(3): 255-260 (2019) - [c6]Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Approximate Strong Edge-Colouring of Unit Disk Graphs. WAOA 2019: 154-169 - [i13]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Strong chromatic index and Hadwiger number. CoRR abs/1905.06031 (2019) - [i12]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel:
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 (2019) - 2018
- [j37]Katherine Edwards, António Girão, Jan van den Heuvel, Ross J. Kang, Gregory J. Puleo, Jean-Sébastien Sereni:
Extension from Precoloured Sets of Edges. Electron. J. Comb. 25(3): 3 (2018) - [j36]Wouter Cames van Batenburg, Ross J. Kang:
Packing Graphs of Bounded Codegree. Comb. Probab. Comput. 27(5): 725-740 (2018) - [j35]Ross J. Kang, François Pirot:
Distance Colouring Without One Cycle Length. Comb. Probab. Comput. 27(5): 794-807 (2018) - [i11]Louis Esperet, Ross J. Kang, Stéphan Thomassé:
Separation choosability and dense bipartite induced subgraphs. CoRR abs/1802.03727 (2018) - [i10]Zdenek Dvorák, Louis Esperet, Ross J. Kang, Kenta Ozeki:
Least conflict choosability. CoRR abs/1803.10962 (2018) - [i9]Ross J. Kang, Willem van Loon:
Tree-like distance colouring for planar graphs of sufficient girth. CoRR abs/1805.02156 (2018) - [i8]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Bipartite induced density in triangle-free graphs. CoRR abs/1808.02512 (2018) - [i7]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Colouring triangle-free graphs with local list sizes. CoRR abs/1812.01534 (2018) - [i6]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. CoRR abs/1812.11152 (2018) - 2017
- [j34]Wouter Cames van Batenburg, Ross J. Kang:
Packing two graphs of even girth 10. Electron. Notes Discret. Math. 61: 191-197 (2017) - [j33]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. Electron. Notes Discret. Math. 61: 663-669 (2017) - [j32]Ross J. Kang, François Pirot:
Distance colouring without one cycle length. Electron. Notes Discret. Math. 61: 695-701 (2017) - [j31]Marthe Bonamy, Ross J. Kang:
List Coloring with a Bounded Palette. J. Graph Theory 84(1): 93-103 (2017) - 2016
- [j30]Ross J. Kang, François Pirot:
Coloring Powers and Girth. SIAM J. Discret. Math. 30(4): 1938-1949 (2016) - [i5]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. CoRR abs/1609.08645 (2016) - [i4]Wouter Cames van Batenburg, Ross J. Kang:
Squared chromatic and stability numbers without claws or large cliques. CoRR abs/1609.08646 (2016) - 2015
- [j29]Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic coloring of grids. Discret. Appl. Math. 186: 286-290 (2015) - [j28]Ross J. Kang, Guillem Perarnau:
Decomposition of bounded degree graphs into C4-free subgraphs. Eur. J. Comb. 44: 99-105 (2015) - [j27]Ross J. Kang, Viresh Patel, Guus Regts:
On a Ramsey-type problem of Erdős and Pach. Electron. Notes Discret. Math. 49: 821-827 (2015) - [j26]Ross J. Kang, János Pach, Viresh Patel, Guus Regts:
A Precise Threshold for Quasi-Ramsey Numbers. SIAM J. Discret. Math. 29(3): 1670-1682 (2015) - 2014
- [j25]Magnus Bordewich, Ross J. Kang:
Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. Electron. J. Comb. 21(4): 4 (2014) - [j24]Tomás Kaiser, Ross J. Kang:
The Distance-t Chromatic Index of Graphs. Comb. Probab. Comput. 23(1): 90-101 (2014) - [j23]Ross J. Kang, Tobias Müller:
Arrangements of Pseudocircles and Circles. Discret. Comput. Geom. 51(4): 896-925 (2014) - [j22]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Eur. J. Comb. 35: 232-244 (2014) - [j21]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean Lattice. Integers 14A: A4 (2014) - [j20]Ross J. Kang, Colin McDiarmid, Bruce A. Reed, Alex D. Scott:
For most graphs H, most H-free graphs have a linear homogeneous set. Random Struct. Algorithms 45(3): 343-361 (2014) - [i3]Ross J. Kang, Tobias Müller, Douglas B. West:
On r-dynamic Coloring of Grids. CoRR abs/1407.3504 (2014) - 2013
- [j19]Ross J. Kang:
Improper Choosability and Property B. J. Graph Theory 73(3): 342-353 (2013) - [i2]Andrew P. Dove, Jerrold R. Griggs, Ross J. Kang, Jean-Sébastien Sereni:
Supersaturation in the Boolean lattice. CoRR abs/1303.4336 (2013) - 2012
- [j18]Ross J. Kang, Putra Manggala:
Distance edge-colourings and matchings. Discret. Appl. Math. 160(16-17): 2435-2439 (2012) - [j17]Ross J. Kang, Tobias Müller:
Sphere and Dot Product Representations of Graphs. Discret. Comput. Geom. 47(3): 548-568 (2012) - [j16]Ross J. Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Planar Graphs. SIAM J. Discret. Math. 26(3): 1383-1411 (2012) - 2011
- [j15]Ross J. Kang, László Lovász, Tobias Müller, Edward R. Scheinerman:
Dot Product Representations of Planar Graphs. Electron. J. Comb. 18(1) (2011) - [j14]Ross J. Kang, Tobias Müller:
Frugal, acyclic and star colourings of graphs. Discret. Appl. Math. 159(16): 1806-1814 (2011) - [j13]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
Largest sparse subgraphs of random graphs. Electron. Notes Discret. Math. 38: 349-354 (2011) - [j12]Ross J. Kang, Jean-Sébastien Sereni, Matej Stehlík:
Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring. SIAM J. Discret. Math. 25(2): 514-533 (2011) - [c5]Ross J. Kang, Tobias Müller:
Sphere and dot product representations of graphs. SCG 2011: 308-314 - [c4]Magnus Bordewich, Ross J. Kang:
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. ICALP (1) 2011: 533-544 - [i1]Magnus Bordewich, Ross J. Kang:
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width. CoRR abs/1102.3635 (2011) - 2010
- [j11]Nikolaos Fountoulakis, Ross J. Kang, Colin McDiarmid:
The t-Stability Number of a Random Graph. Electron. J. Comb. 17(1) (2010) - [j10]Ross J. Kang, Colin McDiarmid:
The t-Improper Chromatic Number of Random Graphs. Comb. Probab. Comput. 19(1): 87-98 (2010) - [j9]Louigi Addario-Berry, Louis Esperet, Ross J. Kang, Colin J. H. McDiarmid, Alexandre Pinlou:
Acyclic improper colourings of graphs with bounded maximum degree. Discret. Math. 310(2): 223-229 (2010) - [j8]Louigi Addario-Berry, Ross J. Kang, Tobias Müller:
Acyclic dominating partitions. J. Graph Theory 64(4): 292-311 (2010) - [c3]Ross J. Kang, Matthias Mnich, Tobias Müller:
Induced Matchings in Subcubic Planar Graphs. ESA (2) 2010: 112-122 - [c2]Ross J. Kang, Tobias Müller:
Dot Product Representations of Planar Graphs. GD 2010: 287-292
2000 – 2009
- 2009
- [j7]Ross J. Kang, Putra Manggala:
On distance edge-colourings and matchings. Electron. Notes Discret. Math. 34: 301-306 (2009) - [j6]Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Circular choosability. J. Graph Theory 61(4): 241-270 (2009) - [j5]Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper coloring of unit disk graphs. Networks 54(3): 150-164 (2009) - [c1]Ross J. Kang, Tobias Müller:
Acyclic and Frugal Colourings of Graphs. CTW 2009: 60-63 - 2008
- [b1]Ross J. Kang:
Improper colourings of graphs. University of Oxford, UK, 2008 - [j4]Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Improper colouring of (random) unit disk graphs. Discret. Math. 308(8): 1438-1454 (2008) - 2007
- [j3]Ross J. Kang, Colin J. H. McDiarmid:
The t-improper chromatic number of random graphs. Electron. Notes Discret. Math. 29: 411-417 (2007) - [j2]Louigi Addario-Berry, Ross J. Kang:
Acyclic dominating partitions. Electron. Notes Discret. Math. 29: 419-425 (2007) - 2005
- [j1]Frédéric Havet, Ross J. Kang, Jean-Sébastien Sereni:
Improper Colourings of Unit Disk Graphs. Electron. Notes Discret. Math. 22: 123-128 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 20:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
