default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDalibor Froncek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j65]Dalibor Froncek
, P. Paananen, L. Sorensen:
Group-supermagic labeling of Cartesian products of two even cycles. Discret. Math. 347(8): 113741 (2024)- 2022
- [j64]Dalibor Froncek, Aaron Shepanik:
Regular handicap graphs of order n ≡ 4 (mod 8). Electron. J. Graph Theory Appl. 10(1): 259 (2022) - [j63]Dalibor Froncek, Mahdi Reza Khorsandi, Seyed Reza Musawi, Jiangyi Qiu:
On families of 2-nearly Platonic graphs. Electron. J. Graph Theory Appl. 10(2): 659-684 (2022) - 2021
- [j62]Dalibor Froncek, Michael Kubesa:
Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges. Bull. ICA 93: 52-80 (2021) - [j61]Marcin Anholcer, Sylwia Cichacz, Dalibor Froncek, Rinovia Simanjuntak, Jiangyi Qiu:
Group distance magic and antimagic hypercubes. Discret. Math. 344(12): 112625 (2021) - [j60]Dalibor Froncek, Mahdi Reza Khorsandi, Seyed Reza Musawi, Jiangyi Qiu:
A note on nearly Platonic graphs with connectivity one. Electron. J. Graph Theory Appl. 9(1): 195-205 (2021) - [j59]Fawwaz Fakhrurrozi Hadiputra, Kiki A. Sugeng, Denny Riama Silaban, Tita Khalis Maryati, Dalibor Froncek:
Chromatic number of super vertex local antimagic total labelings of graphs. Electron. J. Graph Theory Appl. 9(2): 485-498 (2021) - [j58]Aaron Crenshaw, Dalibor Froncek:
Box-Object Redistribution Problem. Am. Math. Mon. 128(5): 456 (2021) - 2020
- [j57]Dalibor Froncek, Michael McKeown:
Note on diagonal construction of Z2nm-supermagic labeling of Cn□Cm. AKCE Int. J. Graphs Comb. 17(3): 952-954 (2020) - [j56]Dalibor Froncek, Jehyun Lee:
Decomposition of complete graphs into bi-cyclic graphs with eight edges. Bull. ICA 88: 30-49 (2020) - [j55]Sylwia Cichacz, Pawel Dyrlaga, Dalibor Froncek:
Group distance magic Cartesian product of two cycles. Discret. Math. 343(5): 111807 (2020)
2010 – 2019
- 2019
- [j54]Dalibor Froncek, Jiangyi Qiu:
Balanced 3-nearly Platonic graphs. Bull. ICA 86: 34-63 (2019) - [j53]Sylwia Cichacz, Bryan J. Freyberg, Dalibor Froncek:
Orientable ℤn-distance magic graphs. Discuss. Math. Graph Theory 39(2): 533-546 (2019) - [j52]John Fahnenstiel, Dalibor Froncek:
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges. Electron. J. Graph Theory Appl. 7(2): 235-250 (2019) - [c3]Dalibor Froncek, Jiangyi Qiu:
Supermagic Graphs with Many Odd Degrees. IWOCA 2019: 229-236 - 2018
- [j51]William J. Keith, Dalibor Froncek, Donald L. Kreher:
A note on nearly platonic graphs. Australas. J Comb. 70: 86-103 (2018) - [j50]William J. Keith, Dalibor Froncek, Donald L. Kreher:
Corrigendum to: A note on nearly platonic graphs. Australas. J Comb. 72: 163- (2018) - [j49]Dalibor Froncek:
You can't always get what you want... Bull. ICA 84: 98-108 (2018) - [j48]Dalibor Froncek, Aaron Shepanik:
On regular handicap graphs of order $n \equiv 0$ mod 8. Electron. J. Graph Theory Appl. 6(2): 208-218 (2018) - 2017
- [j47]Dalibor Froncek:
Magic rectangle sets of odd order. Australas. J Comb. 67: 345-351 (2017) - [j46]Sylwia Cichacz, Dalibor Froncek, Inne Singgih:
Vertex magic total labelings of 2-regular graphs. Discret. Math. 340(1): 3117-3124 (2017) - [j45]Dalibor Froncek:
Decomposition of certain complete bipartite graphs into prisms. Discuss. Math. Graph Theory 37(1): 55-62 (2017) - [j44]S. Arumugam, Dalibor Froncek, Sylwia Cichacz:
Preface. Electron. Notes Discret. Math. 60: 1 (2017) - [j43]Dalibor Froncek, Petr Kovár, Tereza Kovárová, Bohumil Krajc, Michal Kravcenko, Aaron Shepanik, Adam Silber:
On regular handicap graphs of even order. Electron. Notes Discret. Math. 60: 69-76 (2017) - 2016
- [j42]Dalibor Froncek:
Alpha labelings of full hexagonal caterpillars. AKCE Int. J. Graphs Comb. 13(1): 85-89 (2016) - [j41]S. Arumugam, Joe Ryan, Martin Baca, Kiki Ariyanti Sugeng, S. Slamin, Bharathi Rajan, Dalibor Froncek:
In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016. AKCE Int. J. Graphs Comb. 13(2): 210-211 (2016) - [j40]Sylwia Cichacz, Dalibor Froncek:
Distance magic circulant graphs. Discret. Math. 339(1): 84-94 (2016) - [j39]Sylwia Cichacz, Dalibor Froncek, Elliot Krop, Christopher Raridan:
Distance magic Cartesian product of graphs. Discuss. Math. Graph Theory 36(2): 299-308 (2016) - 2015
- [j38]S. Arumugam, Dalibor Froncek, Joe Ryan, Kiki Ariyanti Sugeng, Martin Baca, Mirka Miller:
Preface. Electron. Notes Discret. Math. 48: 1 (2015) - [j37]Sylwia Cichacz, Dalibor Froncek, Kiki A. Sugeng, Sanming Zhou:
Group distance magic and antimagic graphs. Electron. Notes Discret. Math. 48: 41-48 (2015) - [e1]Jan Kratochvíl, Mirka Miller, Dalibor Froncek:
Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8986, Springer 2015, ISBN 978-3-319-19314-4 [contents] - 2014
- [j36]Dalibor Froncek, Amy Hlavacek, Steven J. Rosenberg:
Edge reconstruction and the swapping number of a graph. Australas. J Comb. 58: 1-15 (2014) - 2013
- [j35]Dalibor Froncek:
Group distance magic labeling of Cartesian product of cycles. Australas. J Comb. 55: 167-174 (2013) - [j34]Sylwia Cichacz, Dalibor Froncek, Petr Kovár:
Decomposition of complete bipartite graphs into generalized prisms. Eur. J. Comb. 34(1): 104-110 (2013) - 2012
- [j33]Petr Kovár, Tereza Kovárová, Dalibor Froncek:
A note on 4-regular distance magic graphs. Australas. J Comb. 54: 127-132 (2012) - 2011
- [j32]Dalibor Froncek, Petr Kovár, Michael Kubesa:
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. Graphs Comb. 27(5): 621-646 (2011) - 2010
- [j31]Dalibor Froncek, Petr Kovár, Tereza Kovárová, Michael Kubesa:
Factorizations of complete graphs into caterpillars of diameter 5. Discret. Math. 310(3): 537-556 (2010) - [j30]Dalibor Froncek, Petr Kovár, Michael Kubesa:
Decompositions of complete graphs into blown-up cycles Cm[2]. Discret. Math. 310(5): 1003-1015 (2010)
2000 – 2009
- 2009
- [j29]Dalibor Froncek:
Oberwolfach rectangular table negotiation problem. Discret. Math. 309(2): 501-504 (2009) - [j28]Sylwia Cichacz, Dalibor Froncek:
Factorization of Kn, n into (0, j)-prisms. Inf. Process. Lett. 109(16): 932-934 (2009) - [c2]Sylwia Cichacz, Dalibor Froncek, Petr Kovár:
Note on Decomposition of Kn, n into (0, j)-prisms. IWOCA 2009: 125-133 - 2008
- [j27]Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár:
On biclique coverings. Discret. Math. 308(2-3): 319-323 (2008) - [j26]Dalibor Froncek:
Product rosy labeling of graphs. Discuss. Math. Graph Theory 28(3): 431-439 (2008) - 2007
- [j25]Dalibor Froncek, Tereza Kovárová:
2n-cyclic Blended Labeling of Graphs. Ars Comb. 83 (2007) - [j24]Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár:
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. Comb. Probab. Comput. 16(2): 271-275 (2007) - [j23]Dalibor Froncek:
Bi-cyclic decompositions of complete graphs into spanning trees. Discret. Math. 307(11-12): 1317-1322 (2007) - [j22]Dalibor Froncek:
Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5. Graphs Comb. 23(2): 145-163 (2007) - 2006
- [j21]Dalibor Froncek, Uwe Leck:
Orthogonal double covers of complete graphs by fat catepillars. Discuss. Math. Graph Theory 26(2): 343-349 (2006) - [j20]Michael Kubesa, Dalibor Froncek:
Problem presented at the workshop in Krynica 2004. Discuss. Math. Graph Theory 26(2): 351 (2006) - 2005
- [j19]Dalibor Froncek, Petr Kovár, Tereza Kovárová:
Vertex magic total labeling of products of cycles. Australas. J Comb. 33: 169-182 (2005) - [j18]Dalibor Froncek, Brett Stevens:
Pancomponented 2-factorizations of complete graphs. Discret. Math. 299(1-3): 99-112 (2005) - 2004
- [j17]Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien:
On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24(1): 55-71 (2004) - [j16]Dalibor Froncek:
Cyclic decompositions of complete graphs into spanning trees. Discuss. Math. Graph Theory 24(2): 345-353 (2004) - [j15]Dan Archdeacon, Joanna A. Ellis-Monaghan, David C. Fisher, Dalibor Froncek, Peter Che Bor Lam, Suzanne M. Seager, Bing Wei, Raphael Yuster:
Some remarks on domination. J. Graph Theory 46(3): 207-210 (2004) - 2003
- [j14]Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán:
Regular clique covers of graphs. Australas. J Comb. 27: 307- (2003) - [j13]Charles J. Colbourn, Jeffrey H. Dinitz, Dalibor Froncek:
Preface. Discret. Math. 261(1-3): 1-2 (2003) - 2002
- [j12]Dalibor Froncek:
Cyclic type factorizations of complete bipartite graphs into hypercubes. Australas. J Comb. 25: 201-210 (2002) - 2001
- [j11]Frantisek Franek, Dalibor Froncek, Alexander Rosa:
Imbalance in tournament designs. Australas. J Comb. 23: 237-252 (2001) - [j10]Dalibor Froncek:
On seed graphs with more than two components. Discret. Math. 233(1-3): 115-126 (2001) - [j9]Dalibor Froncek:
Self-complementary factors of almost complete tripartite graphs of even order. Discret. Math. 236(1-3): 111-122 (2001) - [c1]Myra B. Cohen, Charles J. Colbourn, Dalibor Froncek:
Cluttered Orderings for the Complete Graph. COCOON 2001: 420-431 - 2000
- [j8]Dalibor Froncek, Jozef Sirán:
Halving Complete 4-Partite Graphs. Ars Comb. 55 (2000)
1990 – 1999
- 1999
- [j7]Dalibor Froncek:
Note on cyclic decompositions of complete bipartite graphs into cubes. Discuss. Math. Graph Theory 19(2): 219-227 (1999) - 1998
- [j6]Dalibor Froncek:
2-halvable complete 4-partite graphs. Discuss. Math. Graph Theory 18(2): 233-242 (1998) - 1997
- [j5]Dalibor Froncek:
Almost self-complementary factors of complete bipartite graphs. Discret. Math. 167-168: 317-327 (1997) - 1996
- [j4]Dalibor Froncek:
Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters. Australas. J Comb. 13: 61-74 (1996) - [j3]Dalibor Froncek, Alexander Rosa, Jozef Sirán:
The Existence of Selfcomplementary Circulant Graphs. Eur. J. Comb. 17(7): 625-628 (1996) - [j2]Dalibor Froncek:
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters. Graphs Comb. 12(1): 305-320 (1996) - 1994
- [j1]Dalibor Froncek:
e-Realization of double-stars. Discret. Math. 126(1-3): 399-402 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
