The SCEAS System
| |||||||

## Search the dblp DataBase
Dalibor Froncek:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek
**Cluttered Orderings for the Complete Graph.**[Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:420-431 [Conf] - Dalibor Froncek, Jozef Sirán
**Halving Complete 4-Partite Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2000, v:55, n:, pp:- [Journal] - Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek
**Preface.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:261, n:1-3, pp:1-2 [Journal] - Dalibor Froncek
**Self-complementary factors of almost complete tripartite graphs of even order.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:236, n:1-3, pp:111-122 [Journal] - Dalibor Froncek
**On seed graphs with more than two components.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:233, n:1-3, pp:115-126 [Journal] - Dalibor Froncek, Brett Stevens
**Pancomponented 2-factorizations of complete graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:299, n:1-3, pp:99-112 [Journal] - Dalibor Froncek
**Bi-cyclic decompositions of complete graphs into spanning trees.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1317-1322 [Journal] - Dalibor Froncek, Alexander Rosa, Jozef Sirán
**The Existence of Selfcomplementary Circulant Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1996, v:17, n:7, pp:625-628 [Journal] - Dan Archdeacon, J. Ellis-Monaghan, D. Fisher, Dalibor Froncek, Peter Che Bor Lam, S. Seager, B. Wei, Raphael Yuster
**Some remarks on domination.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:46, n:3, pp:207-210 [Journal] - Dalibor Froncek
**Almost self-complementary factors of complete bipartite graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:167, n:, pp:317-327 [Journal] **Note on Decomposition of**[Citation Graph (, )][DBLP]*K*_{n, n}into (0,*j*)-prisms.**2n-cyclic Blended Labeling of Graphs.**[Citation Graph (, )][DBLP]**Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.**[Citation Graph (, )][DBLP]**On biclique coverings.**[Citation Graph (, )][DBLP]**Oberwolfach rectangular table negotiation problem.**[Citation Graph (, )][DBLP]**Factorizations of complete graphs into caterpillars of diameter 5.**[Citation Graph (, )][DBLP]**Decompositions of complete graphs into blown-up cycles C**[Citation Graph (, )][DBLP]_{m}[2].
Search in 0.069secs, Finished in 0.070secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |