Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Czygrinow, Andrzej
and
Nagle, Brendan
2004.
Strong edge colorings of uniform graphs.
Discrete Mathematics,
Vol. 286,
Issue. 3,
p.
219.
Czygrinow, Andrzej
and
Nagle, Brendan
2004.
Bounding the strong chromatic index of dense random graphs.
Discrete Mathematics,
Vol. 281,
Issue. 1-3,
p.
129.
Frieze, Alan
Krivelevich, Michael
and
Sudakov, Benny
2005.
The Strong Chromatic Index of Random Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 19,
Issue. 3,
p.
719.
Kostochka, Alexandr
2006.
More Sets, Graphs and Numbers.
Vol. 15,
Issue. ,
p.
175.
Amini, Omid
and
Reed, Bruce
2008.
List Colouring Constants of Triangle Free Graphs.
Electronic Notes in Discrete Mathematics,
Vol. 30,
Issue. ,
p.
135.
Kang, Ross
and
Manggala, Putra
2009.
On distance edge-colourings and matchings.
Electronic Notes in Discrete Mathematics,
Vol. 34,
Issue. ,
p.
301.
Kang, Ross J.
and
Manggala, Putra
2012.
Distance edge-colourings and matchings.
Discrete Applied Mathematics,
Vol. 160,
Issue. 16-17,
p.
2435.
Pettie, Seth
and
Su, Hsin-Hao
2013.
Automata, Languages, and Programming.
Vol. 7966,
Issue. ,
p.
681.
Pettie, Seth
and
Su, Hsin-Hao
2015.
Distributed coloring algorithms for triangle-free graphs.
Information and Computation,
Vol. 243,
Issue. ,
p.
263.
Bansal, Nikhil
Gupta, Anupam
and
Guruganesh, Guru
2015.
On the Lovász Theta function for Independent Sets in Sparse Graphs.
p.
193.
Kang, Ross J.
and
Pirot, François
2017.
Distance colouring without one cycle length.
Electronic Notes in Discrete Mathematics,
Vol. 61,
Issue. ,
p.
695.
Kim, Jaehoon
and
Ok, Seongmin
2018.
Dynamic choosability of triangle‐free graphs and sparse random graphs.
Journal of Graph Theory,
Vol. 87,
Issue. 3,
p.
347.
KANG, ROSS J.
and
PIROT, FRANÇOIS
2018.
Distance Colouring Without One Cycle Length.
Combinatorics, Probability and Computing,
Vol. 27,
Issue. 5,
p.
794.
Yegnanarayanan, Venkataraman
Yegnanarayanan, Gayathri Narayana
and
M. Balas, Marius
2018.
On Coloring Catalan Number Distance Graphs and Interference Graphs.
Symmetry,
Vol. 10,
Issue. 10,
p.
468.
Bansal, Nikhil
Gupta, Anupam
and
Guruganesh, Guru
2018.
On the Lovász Theta Function for Independent Sets in Sparse Graphs.
SIAM Journal on Computing,
Vol. 47,
Issue. 3,
p.
1039.
Harris, David G.
2019.
Some Results on Chromatic Number as a Function of Triangle Count.
SIAM Journal on Discrete Mathematics,
Vol. 33,
Issue. 1,
p.
546.
Dębski, Michał
2019.
Strong chromatic index of unit distance graphs.
Journal of Graph Theory,
Vol. 90,
Issue. 4,
p.
523.
Achlioptas, Dimitris
Iliopoulos, Fotis
and
Sinclair, Alistair
2019.
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications.
p.
725.
Faber, Vance
and
Harris, David G.
2019.
Edge‐coloring linear hypergraphs with medium‐sized edges.
Random Structures & Algorithms,
Vol. 55,
Issue. 1,
p.
153.
Chang, Yi-Jun
Li, Wenzheng
and
Pettie, Seth
2020.
Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering.
SIAM Journal on Computing,
Vol. 49,
Issue. 3,
p.
497.