The SCEAS System
Navigation Menu

Search the dblp DataBase


Dalibor Froncek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Dalibor Froncek, Jozef Sirán
    Halving Complete 4-Partite Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:55, n:, pp:- [Journal]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]

  11. Note on Decomposition of Kn, n into (0, j)-prisms. [Citation Graph (, )][DBLP]

  12. 2n-cyclic Blended Labeling of Graphs. [Citation Graph (, )][DBLP]

  13. Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. [Citation Graph (, )][DBLP]

  14. On biclique coverings. [Citation Graph (, )][DBLP]

  15. Oberwolfach rectangular table negotiation problem. [Citation Graph (, )][DBLP]

  16. Factorizations of complete graphs into caterpillars of diameter 5. [Citation Graph (, )][DBLP]

  17. Decompositions of complete graphs into blown-up cycles Cm[2]. [Citation Graph (, )][DBLP]

Search in 0.015secs, Finished in 0.016secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002