e-Realization of double-stars. - Dalibor Froncek (Discret. Math., 1994)

Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters. - Dalibor Froncek (Australas. J Comb., 1996)

The Existence of Selfcomplementary Circulant Graphs. - Dalibor Froncek; Alexander Rosa; Jozef Sirán (Eur. J. Comb., 1996)

Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters. - Dalibor Froncek (Graphs Comb., 1996)

Almost self-complementary factors of complete bipartite graphs. - Dalibor Froncek (Discret. Math., 1997)

2-halvable complete 4-partite graphs. - Dalibor Froncek (Discuss. Math. Graph Theory, 1998)

Note on cyclic decompositions of complete bipartite graphs into cubes. - Dalibor Froncek (Discuss. Math. Graph Theory, 1999)

Halving Complete 4-Partite Graphs. - Dalibor Froncek; Jozef Sirán (Ars Comb., 2000)

Cluttered Orderings for the Complete Graph. - Myra B. Cohen; Charles J. Colbourn; Dalibor Froncek (COCOON, 2001)

Imbalance in tournament designs. - Frantisek Franek; Dalibor Froncek; Alexander Rosa (Australas. J Comb., 2001)

Self-complementary factors of almost complete tripartite graphs of even order. - Dalibor Froncek (Discret. Math., 2001)

On seed graphs with more than two components. - Dalibor Froncek (Discret. Math., 2001)

Cyclic type factorizations of complete bipartite graphs into hypercubes. - Dalibor Froncek (Australas. J Comb., 2002)

Regular clique covers of graphs. - Dan Archdeacon; Dalibor Froncek; Robert Jajcay; Zdenek Ryjácek; Jozef Sirán (Australas. J Comb., 2003)

Preface. - Charles J. Colbourn; Jeffrey H. Dinitz; Dalibor Froncek (Discret. Math., 2003)

Cyclic decompositions of complete graphs into spanning trees. - Dalibor Froncek (Discuss. Math. Graph Theory, 2004)

On traceability and 2-factors in claw-free graphs. - Dalibor Froncek; Zdenek Ryjácek; Zdzislaw Skupien (Discuss. Math. Graph Theory, 2004)

Some remarks on domination. - Dan Archdeacon; Joanna A. Ellis-Monaghan; David C. Fisher; Dalibor Froncek; Peter Che Bor Lam; Suzanne M. Seager; Bing Wei 001; Raphael Yuster (J. Graph Theory, 2004)

Vertex magic total labeling of products of cycles. - Dalibor Froncek; Petr Kovár; Tereza Kovárová (Australas. J Comb., 2005)

Pancomponented 2-factorizations of complete graphs. - Dalibor Froncek; Brett Stevens (Discret. Math., 2005)

Orthogonal double covers of complete graphs by fat catepillars. - Dalibor Froncek; Uwe Leck (Discuss. Math. Graph Theory, 2006)

Problem presented at the workshop in Krynica 2004. - Michael Kubesa; Dalibor Froncek (Discuss. Math. Graph Theory, 2006)

2n-cyclic Blended Labeling of Graphs. - Dalibor Froncek; Tereza Kovárová (Ars Comb., 2007)

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. - Dalibor Froncek; Janja Jerebic; Sandi Klavzar; Petr Kovár (Comb. Probab. Comput., 2007)

Bi-cyclic decompositions of complete graphs into spanning trees. - Dalibor Froncek (Discret. Math., 2007)

Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5. - Dalibor Froncek (Graphs Comb., 2007)

On biclique coverings. - Sergei L. Bezrukov; Dalibor Froncek; Steven J. Rosenberg; Petr Kovár (Discret. Math., 2008)

Product rosy labeling of graphs. - Dalibor Froncek (Discuss. Math. Graph Theory, 2008)

Note on Decomposition of Kn, n into (0, j)-prisms. - Sylwia Cichacz; Dalibor Froncek; Petr Kovár (IWOCA, 2009)

Oberwolfach rectangular table negotiation problem. - Dalibor Froncek (Discret. Math., 2009)

Factorization of Kn, n into (0, j)-prisms. - Sylwia Cichacz; Dalibor Froncek (Inf. Process. Lett., 2009)

Decompositions of complete graphs into blown-up cycles Cm[2]. - Dalibor Froncek; Petr Kovár; Michael Kubesa (Discret. Math., 2010)

Factorizations of complete graphs into caterpillars of diameter 5. - Dalibor Froncek; Petr Kovár; Tereza Kovárová; Michael Kubesa (Discret. Math., 2010)

Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. - Dalibor Froncek; Petr Kovár; Michael Kubesa (Graphs Comb., 2011)

A note on 4-regular distance magic graphs. - Petr Kovár; Tereza Kovárová; Dalibor Froncek (Australas. J Comb., 2012)

Group distance magic labeling of Cartesian product of cycles. - Dalibor Froncek (Australas. J Comb., 2013)

Decomposition of complete bipartite graphs into generalized prisms. - Sylwia Cichacz; Dalibor Froncek; Petr Kovár (Eur. J. Comb., 2013)

Edge reconstruction and the swapping number of a graph. - Dalibor Froncek; Amy Hlavacek; Steven J. Rosenberg (Australas. J Comb., 2014)

Preface. - S. Arumugam 001; Dalibor Froncek; Joe Ryan 001; Kiki Ariyanti Sugeng; Martin Baca; Mirka Miller (Electron. Notes Discret. Math., 2015)

Group distance magic and antimagic graphs. - Sylwia Cichacz; Dalibor Froncek; Kiki A. Sugeng; Sanming Zhou (Electron. Notes Discret. Math., 2015)

In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016. - S. Arumugam 001; Joe Ryan 001; Martin Baca; Kiki Ariyanti Sugeng; S. Slamin 001; Bharathi Rajan; Dalibor Froncek (AKCE Int. J. Graphs Comb., 2016)

Alpha labelings of full hexagonal caterpillars. - Dalibor Froncek (AKCE Int. J. Graphs Comb., 2016)

Distance magic circulant graphs. - Sylwia Cichacz; Dalibor Froncek (Discret. Math., 2016)

Distance magic Cartesian product of graphs. - Sylwia Cichacz; Dalibor Froncek; Elliot Krop; Christopher Raridan (Discuss. Math. Graph Theory, 2016)

Magic rectangle sets of odd order. - Dalibor Froncek (Australas. J Comb., 2017)

Vertex magic total labelings of 2-regular graphs. - Sylwia Cichacz; Dalibor Froncek; Inne Singgih (Discret. Math., 2017)

Decomposition of certain complete bipartite graphs into prisms. - Dalibor Froncek (Discuss. Math. Graph Theory, 2017)

Preface. - S. Arumugam 001; Dalibor Froncek; Sylwia Cichacz (Electron. Notes Discret. Math., 2017)

On regular handicap graphs of even order. - Dalibor Froncek; Petr Kovár; Tereza Kovárová; Bohumil Krajc; Michal Kravcenko; Aaron Shepanik; Adam Silber (Electron. Notes Discret. Math., 2017)

A note on nearly platonic graphs. - William J. Keith; Dalibor Froncek; Donald L. Kreher (Australas. J Comb., 2018)

Corrigendum to: A note on nearly platonic graphs. - William J. Keith; Dalibor Froncek; Donald L. Kreher (Australas. J Comb., 2018)

You can't always get what you want... - Dalibor Froncek (Bull. ICA, 2018)

On regular handicap graphs of order $n equiv 0$ mod 8. - Dalibor Froncek; Aaron Shepanik (Electron. J. Graph Theory Appl., 2018)

Supermagic Graphs with Many Odd Degrees. - Dalibor Froncek; Jiangyi Qiu (IWOCA, 2019)

Balanced 3-nearly Platonic graphs. - Dalibor Froncek; Jiangyi Qiu (Bull. ICA, 2019)

Orientable ℤn-distance magic graphs. - Sylwia Cichacz; Bryan J. Freyberg; Dalibor Froncek (Discuss. Math. Graph Theory, 2019)

Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges. - John Fahnenstiel; Dalibor Froncek (Electron. J. Graph Theory Appl., 2019)

Note on diagonal construction of Z2nm-supermagic labeling of Cn□Cm. - Dalibor Froncek; Michael McKeown (AKCE Int. J. Graphs Comb., 2020)

Decomposition of complete graphs into bi-cyclic graphs with eight edges. - Dalibor Froncek; Jehyun Lee (Bull. ICA, 2020)

Group distance magic Cartesian product of two cycles. - Sylwia Cichacz; Pawel Dyrlaga; Dalibor Froncek (Discret. Math., 2020)

Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges. - Dalibor Froncek; Michael Kubesa (Bull. ICA, 2021)

Group distance magic and antimagic hypercubes. - Marcin Anholcer; Sylwia Cichacz; Dalibor Froncek; Rinovia Simanjuntak; Jiangyi Qiu (Discret. Math., 2021)

A note on nearly Platonic graphs with connectivity one. - Dalibor Froncek; Mahdi Reza Khorsandi; Seyed Reza Musawi; Jiangyi Qiu (Electron. J. Graph Theory Appl., 2021)

Chromatic number of super vertex local antimagic total labelings of graphs. - Fawwaz Fakhrurrozi Hadiputra; Kiki A. Sugeng; Denny Riama Silaban; Tita Khalis Maryati; Dalibor Froncek (Electron. J. Graph Theory Appl., 2021)

Box-Object Redistribution Problem. - Aaron Crenshaw; Dalibor Froncek (Am. Math. Mon., 2021)

On families of 2-nearly Platonic graphs. - Dalibor Froncek; Mahdi Reza Khorsandi; Seyed Reza Musawi; Jiangyi Qiu (Electron. J. Graph Theory Appl., 2022)

Regular handicap graphs of order n ≡ 4 (mod 8). - Dalibor Froncek; Aaron Shepanik (Electron. J. Graph Theory Appl., 2022)

Group-supermagic labeling of Cartesian products of two even cycles. - Dalibor Froncek; P. Paananen; L. Sorensen (Discret. Math., 2024)