 | 2011 |
| 24 |  | Dalibor Froncek,
Petr Kovár,
Michael Kubesa:
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.
Graphs and Combinatorics 27(5): 621-646 (2011) |
| 2010 |
| 23 |  | Dalibor Froncek,
Petr Kovár,
Tereza Kovarova,
Michael Kubesa:
Factorizations of complete graphs into caterpillars of diameter 5.
Discrete Mathematics 310(3): 537-556 (2010) |
| 22 |  | Dalibor Froncek,
Petr Kovár,
Michael Kubesa:
Decompositions of complete graphs into blown-up cycles Cm[2].
Discrete Mathematics 310(5): 1003-1015 (2010) |
| 2009 |
| 21 |  | Sylwia Cichacz,
Dalibor Froncek,
Petr Kovár:
Note on Decomposition of Kn, n into (0, j)-prisms.
IWOCA 2009: 125-133 |
| 20 |  | Dalibor Froncek:
Oberwolfach rectangular table negotiation problem.
Discrete Mathematics 309(2): 501-504 (2009) |
| 19 |  | Sylwia Cichacz,
Dalibor Froncek:
Factorization of Kn, n into (0, j)-prisms.
Inf. Process. Lett. 109(16): 932-934 (2009) |
| 2008 |
| 18 |  | Sergei L. Bezrukov,
Dalibor Froncek,
Steven J. Rosenberg,
Petr Kovár:
On biclique coverings.
Discrete Mathematics 308(2-3): 319-323 (2008) |
| 17 |  | Dalibor Froncek:
Product rosy labeling of graphs.
Discussiones Mathematicae Graph Theory 28(3): 431-439 (2008) |
| 2007 |
| 16 |  | Dalibor Froncek,
Tereza Kovarova:
2n-cyclic Blended Labeling of Graphs.
Ars Comb. 83: (2007) |
| 15 |  | Dalibor Froncek,
Janja Jerebic,
Sandi Klavzar,
Petr Kovár:
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
Combinatorics, Probability & Computing 16(2): 271-275 (2007) |
| 14 |  | Dalibor Froncek:
Bi-cyclic decompositions of complete graphs into spanning trees.
Discrete Mathematics 307(11-12): 1317-1322 (2007) |
| 13 |  | Dalibor Froncek:
Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5.
Graphs and Combinatorics 23(2): 145-163 (2007) |
| 2006 |
| 12 |  | Dalibor Froncek,
Uve Leck:
Orthogonal double covers of complete graphs by fat catepillars.
Discussiones Mathematicae Graph Theory 26(2): 343-349 (2006) |
| 11 |  | Michael Kubesa,
Dalibor Froncek:
Problem presented at the workshop in Krynica 2004.
Discussiones Mathematicae Graph Theory 26(2): 351 (2006) |
| 2005 |
| 10 |  | Dalibor Froncek,
Brett Stevens:
Pancomponented 2-factorizations of complete graphs.
Discrete Mathematics 299(1-3): 99-112 (2005) |
| 2004 |
| 9 |  | Dan Archdeacon,
Joanna A. Ellis-Monaghan,
D. Fisher,
Dalibor Froncek,
Peter Che Bor Lam,
Suzanne M. Seager,
B. Wei,
Raphael Yuster:
Some remarks on domination.
Journal of Graph Theory 46(3): 207-210 (2004) |
| 2003 |
| 8 |  | Charles J. Colbourn,
Jeffrey H. Dinitz,
Dalibor Froncek:
Preface.
Discrete Mathematics 261(1-3): 1-2 (2003) |
| 2001 |
| 7 |  | Myra B. Cohen,
Charles J. Colbourn,
Dalibor Froncek:
Cluttered Orderings for the Complete Graph.
COCOON 2001: 420-431 |
| 6 |  | Dalibor Froncek:
On seed graphs with more than two components.
Discrete Mathematics 233(1-3): 115-126 (2001) |
| 5 |  | Dalibor Froncek:
Self-complementary factors of almost complete tripartite graphs of even order.
Discrete Mathematics 236(1-3): 111-122 (2001) |
| 2000 |
| 4 |  | Dalibor Froncek,
Jozef Sirán:
Halving Complete 4-Partite Graphs.
Ars Comb. 55: (2000) |
| 1997 |
| 3 |  | Dalibor Froncek:
Almost self-complementary factors of complete bipartite graphs.
Discrete Mathematics 167-168: 317-327 (1997) |
| 1996 |
| 2 |  | Dalibor Froncek,
Alexander Rosa,
Jozef Sirán:
The Existence of Selfcomplementary Circulant Graphs.
Eur. J. Comb. 17(7): 625-628 (1996) |
| 1 |  | Dalibor Froncek:
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters.
Graphs and Combinatorics 12(1): 305-320 (1996) |