Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Balister, P.N
2003.
Packing closed trails into dense graphs.
Journal of Combinatorial Theory, Series B,
Vol. 88,
Issue. 1,
p.
107.
Balister, P. N.
Riordan, O. M.
and
Schelp, R. H.
2003.
Vertex‐distinguishing edge colorings of graphs.
Journal of Graph Theory,
Vol. 42,
Issue. 2,
p.
95.
Balister, P.N.
Kostochka, A.
Li, Hao
and
Schelp, R.H.
2004.
Balanced edge colorings.
Journal of Combinatorial Theory, Series B,
Vol. 90,
Issue. 1,
p.
3.
Bryant, Darryn
Horsley, Daniel
and
Maenhaut, Barbara
2005.
Decompositions into 2-regular subgraphs and equitable partial cycle decompositions.
Journal of Combinatorial Theory, Series B,
Vol. 93,
Issue. 1,
p.
67.
Billington, Elizabeth J.
and
Cavenagh, Nicholas J.
2007.
Decomposing complete tripartite graphs into closed trails of arbitrary lengths.
Czechoslovak Mathematical Journal,
Vol. 57,
Issue. 2,
p.
523.
Bryant, Darryn
and
Horsley, Daniel
2008.
Packing cycles in complete graphs.
Journal of Combinatorial Theory, Series B,
Vol. 98,
Issue. 5,
p.
1014.
Horňák, Mirko
and
Kocková, Zuzana
2008.
On Planar Graphs Arbitrarily Decomposable into Closed Trails.
Graphs and Combinatorics,
Vol. 24,
Issue. 1,
p.
19.
Bryant, Darryn
and
Maenhaut, Barbara
2008.
Almost regular edge colorings and regular decompositions of complete graphs.
Journal of Combinatorial Designs,
Vol. 16,
Issue. 6,
p.
499.
Horňák, Mirko
and
Woźniak, Mariusz
2008.
On arbitrarily vertex decomposable trees.
Discrete Mathematics,
Vol. 308,
Issue. 7,
p.
1268.
Billington, Elizabeth J.
and
Cavenagh, Nicholas J.
2008.
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths.
Graphs and Combinatorics,
Vol. 24,
Issue. 3,
p.
129.
Rudašová, Janka
and
Soták, Roman
2008.
Vertex-distinguishing proper edge colourings of some regular graphs.
Discrete Mathematics,
Vol. 308,
Issue. 5-6,
p.
795.
Burgess, Andrea
and
Šajna, Mateja
2009.
Closed trail decompositions of complete equipartite graphs.
Journal of Combinatorial Designs,
Vol. 17,
Issue. 5,
p.
374.
Cichacz, Sylwia
Egawa, Yoshimi
and
Woźniak, Mariusz
2009.
Arbitrary decompositions into open and closed trails.
Discrete Mathematics,
Vol. 309,
Issue. 6,
p.
1511.
Cichacz, Sylwia
and
Horňák, Mirko
2009.
Decomposition of bipartite graphs into closed trails.
Czechoslovak Mathematical Journal,
Vol. 59,
Issue. 1,
p.
129.
Cichacz, Sylwia
Przybyło, Jakub
and
Woźniak, Mariusz
2009.
Decompositions of pseudographs into closed trails of even sizes.
Discrete Mathematics,
Vol. 309,
Issue. 15,
p.
4903.
Cichacz, Sylwia
and
Görlich, Agnieszka
2010.
Edge-disjoint Open Trails in Complete Bipartite Multigraphs.
Graphs and Combinatorics,
Vol. 26,
Issue. 2,
p.
207.
Smith, Benjamin R.
2010.
Decomposing Complete Equipartite Graphs into Closed Trails of Length k.
Graphs and Combinatorics,
Vol. 26,
Issue. 1,
p.
133.
Bryant, Darryn
and
Horsley, Daniel
2010.
An asymptotic solution to the cycle decomposition problem for complete graphs.
Journal of Combinatorial Theory, Series A,
Vol. 117,
Issue. 8,
p.
1258.
Bryant, Darryn
Horsley, Daniel
Maenhaut, Barbara
and
Smith, Benjamin R.
2011.
Cycle decompositions of complete multigraphs.
Journal of Combinatorial Designs,
Vol. 19,
Issue. 1,
p.
42.
Smith, Benjamin R.
Küçükçifçi, Selda
and
Yazıcı, Emineşule
2011.
Decomposing complete multipartite graphs into closed trails of arbitrary even lengths.
Journal of Combinatorial Designs,
Vol. 19,
Issue. 6,
p.
455.