2009 |
14 | EE | Dalibor Froncek:
Oberwolfach rectangular table negotiation problem.
Discrete Mathematics 309(2): 501-504 (2009) |
2008 |
13 | EE | Sergei L. Bezrukov,
Dalibor Froncek,
Steven J. Rosenberg,
Petr Kovár:
On biclique coverings.
Discrete Mathematics 308(2-3): 319-323 (2008) |
2007 |
12 | | Dalibor Froncek,
Tereza Kovarova:
2n-cyclic Blended Labeling of Graphs.
Ars Comb. 83: (2007) |
11 | EE | 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) |
10 | EE | Dalibor Froncek:
Bi-cyclic decompositions of complete graphs into spanning trees.
Discrete Mathematics 307(11-12): 1317-1322 (2007) |
2005 |
9 | EE | Dalibor Froncek,
Brett Stevens:
Pancomponented 2-factorizations of complete graphs.
Discrete Mathematics 299(1-3): 99-112 (2005) |
2004 |
8 | EE | 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 |
7 | EE | Charles J. Colbourn,
Jeffrey H. Dinitz,
Dalibor Froncek:
Preface.
Discrete Mathematics 261(1-3): 1-2 (2003) |
2001 |
6 | EE | Myra B. Cohen,
Charles J. Colbourn,
Dalibor Froncek:
Cluttered Orderings for the Complete Graph.
COCOON 2001: 420-431 |
5 | EE | Dalibor Froncek:
On seed graphs with more than two components.
Discrete Mathematics 233(1-3): 115-126 (2001) |
4 | EE | Dalibor Froncek:
Self-complementary factors of almost complete tripartite graphs of even order.
Discrete Mathematics 236(1-3): 111-122 (2001) |
2000 |
3 | | Dalibor Froncek,
Jozef Sirán:
Halving Complete 4-Partite Graphs.
Ars Comb. 55: (2000) |
1997 |
2 | EE | Dalibor Froncek:
Almost self-complementary factors of complete bipartite graphs.
Discrete Mathematics 167-168: 317-327 (1997) |
1996 |
1 | EE | Dalibor Froncek,
Alexander Rosa,
Jozef Sirán:
The Existence of Selfcomplementary Circulant Graphs.
Eur. J. Comb. 17(7): 625-628 (1996) |