Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Bohman, T.
Ruszinko, M.
and
Thoma, L.
2000.
Shannon capacity of large odd cycles.
p.
179.
Fertin, Guillaume
Godard, Emmanuel
and
Raspaud, André
2003.
Acyclic and k-distance coloring of the grid.
Information Processing Letters,
Vol. 87,
Issue. 1,
p.
51.
Král', Daniel
2004.
Coloring Powers of Chordal Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 18,
Issue. 3,
p.
451.
Körner, János
Pilotto, Concetta
and
Simonyi, Gábor
2005.
Local chromatic number and Sperner capacity.
Journal of Combinatorial Theory, Series B,
Vol. 95,
Issue. 1,
p.
101.
Govindaraju, Naga K.
Kabul, Ilknur
Lin, Ming C.
and
Manocha, Dinesh
2007.
Fast continuous collision detection among deformable models using graphics processors.
Computers & Graphics,
Vol. 31,
Issue. 1,
p.
5.
Dvořák, Zdeněk
Král’, Daniel
Nejedlý, Pavel
and
Škrekovski, Riste
2008.
Coloring squares of planar graphs with girth six.
European Journal of Combinatorics,
Vol. 29,
Issue. 4,
p.
838.
Sereni, Jean-Sébastien
2008.
Randomly colouring graphs (a combinatorial view).
Computer Science Review,
Vol. 2,
Issue. 2,
p.
63.
Amini, Omid
Giroire, Frédéric
Pérennes, Stéphane
and
Huc, Florian
2010.
Minimal selectors and fault tolerant networks.
Networks,
Vol. 55,
Issue. 4,
p.
326.
Iradmusa, Moharram N.
2010.
On colorings of graph fractional powers.
Discrete Mathematics,
Vol. 310,
Issue. 10-11,
p.
1551.
Cranston, Daniel W.
Kim, Seog-Jin
and
Yu, Gexin
2010.
Injective colorings of sparse graphs.
Discrete Mathematics,
Vol. 310,
Issue. 21,
p.
2965.
Kang, Ross J.
and
Müller, Tobias
2011.
Frugal, acyclic and star colourings of graphs.
Discrete Applied Mathematics,
Vol. 159,
Issue. 16,
p.
1806.
Khan, Nasreen
Pal, Madhumangal
and
Pal, Anita
2012.
<i>L</i>(0, 1)-Labelling of Cactus Graphs.
Communications and Network,
Vol. 04,
Issue. 01,
p.
18.
Farzad, Babak
Lau, Lap Chi
Le, Van Bang
and
Tuy, Nguyen Ngoc
2012.
Complexity of Finding Graph Roots with Girth Conditions.
Algorithmica,
Vol. 62,
Issue. 1-2,
p.
38.
KAISER, TOMÁŠ
and
KANG, ROSS J.
2014.
The Distance-t Chromatic Index of Graphs.
Combinatorics, Probability and Computing,
Vol. 23,
Issue. 1,
p.
90.
Chalermsook, Parinya
Laekhanukit, Bundit
and
Nanongkai, Danupon
2014.
LATIN 2014: Theoretical Informatics.
Vol. 8392,
Issue. ,
p.
409.
Carmesin, J.
Diestel, R.
Hamann, M.
and
Hundertmark, F.
2014.
$k$-Blocks: A Connectivity Invariant for Graphs.
SIAM Journal on Discrete Mathematics,
Vol. 28,
Issue. 4,
p.
1876.
Kelarev, Andrei
Ras, Charl
and
Zhou, Sanming
2015.
Distance labellings of Cayley graphs of semigroups.
Semigroup Forum,
Vol. 91,
Issue. 3,
p.
611.
Chang, Maw-Shang
Ko, Ming-Tat
and
Lu, Hsueh-I
2015.
Linear-Time Algorithms for Tree Root Problems.
Algorithmica,
Vol. 71,
Issue. 2,
p.
471.
Kang, Ross J.
and
Pirot, François
2016.
Coloring Powers and Girth.
SIAM Journal on Discrete Mathematics,
Vol. 30,
Issue. 4,
p.
1938.
Shaheen, Ramy
Kanaya, Ziad
and
Jakhlab, Samar
2017.
<i>d-Distance</i> Coloring of Generalized Petersen Graphs <i>P(n, k)</i>.
Open Journal of Discrete Mathematics,
Vol. 07,
Issue. 04,
p.
185.