Dalibor Froncek

Orcid: 0000-0003-4528-2059

According to our database1, Dalibor Froncek authored at least 67 papers between 1994 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Regular handicap graphs of order n ≡ 4 (mod 8).
Electron. J. Graph Theory Appl., 2022

On families of 2-nearly Platonic graphs.
Electron. J. Graph Theory Appl., 2022

2021
Box-Object Redistribution Problem.
Am. Math. Mon., 2021

Chromatic number of super vertex local antimagic total labelings of graphs.
Electron. J. Graph Theory Appl., 2021

A note on nearly Platonic graphs with connectivity one.
Electron. J. Graph Theory Appl., 2021

Group distance magic and antimagic hypercubes.
Discret. Math., 2021

Decompositions of complete graphs into connected unicyclic bipartite graphs with seven edges.
Bull. ICA, 2021

2020
Group distance magic Cartesian product of two cycles.
Discret. Math., 2020

Decomposition of complete graphs into bi-cyclic graphs with eight edges.
Bull. ICA, 2020

Note on diagonal construction of Z2nm-supermagic labeling of Cn□Cm.
AKCE Int. J. Graphs Comb., 2020

2019
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges.
Electron. J. Graph Theory Appl., 2019

Orientable <i>ℤ<sub>n</sub></i>-distance magic graphs.
Discuss. Math. Graph Theory, 2019

Balanced 3-nearly Platonic graphs.
Bull. ICA, 2019

Supermagic Graphs with Many Odd Degrees.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

2018
On regular handicap graphs of order $n \equiv 0$ mod 8.
Electron. J. Graph Theory Appl., 2018

You can't always get what you want...
Bull. ICA, 2018

Corrigendum to: A note on nearly platonic graphs.
Australas. J Comb., 2018

A note on nearly platonic graphs.
Australas. J Comb., 2018

2017
On regular handicap graphs of even order.
Electron. Notes Discret. Math., 2017

Preface.
Electron. Notes Discret. Math., 2017

Decomposition of certain complete bipartite graphs into prisms.
Discuss. Math. Graph Theory, 2017

Vertex magic total labelings of 2-regular graphs.
Discret. Math., 2017

Magic rectangle sets of odd order.
Australas. J Comb., 2017

2016
Distance magic Cartesian product of graphs.
Discuss. Math. Graph Theory, 2016

Distance magic circulant graphs.
Discret. Math., 2016

Alpha labelings of full hexagonal caterpillars.
AKCE Int. J. Graphs Comb., 2016

In memoriam Emeritus Professor Mirka Miller 09-05-1949 : 02-01-2016.
AKCE Int. J. Graphs Comb., 2016

2015
Group distance magic and antimagic graphs.
Electron. Notes Discret. Math., 2015

Preface.
Electron. Notes Discret. Math., 2015

2014
Edge reconstruction and the swapping number of a graph.
Australas. J Comb., 2014

2013
Decomposition of complete bipartite graphs into generalized prisms.
Eur. J. Comb., 2013

Group distance magic labeling of Cartesian product of cycles.
Australas. J Comb., 2013

2012
A note on 4-regular distance magic graphs.
Australas. J Comb., 2012

2011
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.
Graphs Comb., 2011

2010
Factorizations of complete graphs into caterpillars of diameter 5.
Discret. Math., 2010

Decompositions of complete graphs into blown-up cycles C<sub>m</sub>[2].
Discret. Math., 2010

2009
Factorization of K<sub>n, n</sub> into (0, j)-prisms.
Inf. Process. Lett., 2009

Oberwolfach rectangular table negotiation problem.
Discret. Math., 2009

Note on Decomposition of <i>K</i><sub><i>n</i>, <i>n</i></sub> into (0, <i>j</i>)-prisms.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Product rosy labeling of graphs.
Discuss. Math. Graph Theory, 2008

On biclique coverings.
Discret. Math., 2008

2007
Orthogonal Double Covers of Complete Graphs by Caterpillars of Diameter 5.
Graphs Comb., 2007

Bi-cyclic decompositions of complete graphs into spanning trees.
Discret. Math., 2007

Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
Comb. Probab. Comput., 2007

2n-cyclic Blended Labeling of Graphs.
Ars Comb., 2007

2006
Problem presented at the workshop in Krynica 2004.
Discuss. Math. Graph Theory, 2006

Orthogonal double covers of complete graphs by fat catepillars.
Discuss. Math. Graph Theory, 2006

2005
Pancomponented 2-factorizations of complete graphs.
Discret. Math., 2005

Vertex magic total labeling of products of cycles.
Australas. J Comb., 2005

2004
Some remarks on domination.
J. Graph Theory, 2004

On traceability and 2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2004

Cyclic decompositions of complete graphs into spanning trees.
Discuss. Math. Graph Theory, 2004

2003
Preface.
Discret. Math., 2003

Regular clique covers of graphs.
Australas. J Comb., 2003

2002
Cyclic type factorizations of complete bipartite graphs into hypercubes.
Australas. J Comb., 2002

2001
On seed graphs with more than two components.
Discret. Math., 2001

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

Imbalance in tournament designs.
Australas. J Comb., 2001

Cluttered Orderings for the Complete Graph.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Halving Complete 4-Partite Graphs.
Ars Comb., 2000

1999
Note on cyclic decompositions of complete bipartite graphs into cubes.
Discuss. Math. Graph Theory, 1999

1998
2-halvable complete 4-partite graphs.
Discuss. Math. Graph Theory, 1998

1997
Almost self-complementary factors of complete bipartite graphs.
Discret. Math., 1997

1996
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters.
Graphs Comb., 1996

The Existence of Selfcomplementary Circulant Graphs.
Eur. J. Comb., 1996

Decompositions of complete multipartite graphs into selfcomplementary factors with finite diameters.
Australas. J Comb., 1996

1994
e-Realization of double-stars.
Discret. Math., 1994


  Loading...