Dalibor Fronček

From MaRDI portal
Person:186109

Available identifiers

zbMath Open froncek.daliborMaRDI QIDQ186109

List of research outcomes

PublicationDate of PublicationType
Quasimagic rectangles2024-02-05Paper
Supermagic labeling of $C_n\Box C_m$2022-12-30Paper
On families of 2-nearly Platonic graphs2022-11-29Paper
Regular handicap graphs of order n ≡ 4 (mod 8)2022-06-14Paper
Chromatic number of super vertex local antimagic total labelings of graphs2022-03-14Paper
https://portal.mardi4nfdi.de/entity/Q50324292022-02-16Paper
Group distance magic and antimagic hypercubes2021-09-30Paper
A note on nearly Platonic graphs with connectivity one2021-09-06Paper
https://portal.mardi4nfdi.de/entity/Q49562052021-09-01Paper
Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges2021-08-23Paper
Regular handicap graphs of order $n \equiv 0$ (mod 8)2021-08-23Paper
Box-Object Redistribution Problem2021-05-12Paper
https://portal.mardi4nfdi.de/entity/Q58553962021-03-18Paper
https://portal.mardi4nfdi.de/entity/Q58553982021-03-18Paper
Group distance magic Cartesian product of two cycles2020-03-20Paper
Supermagic graphs with many odd degrees2020-02-25Paper
2-nearly Platonic graphs are unique2019-11-13Paper
https://portal.mardi4nfdi.de/entity/Q52411242019-10-30Paper
https://portal.mardi4nfdi.de/entity/Q52359602019-10-14Paper
https://portal.mardi4nfdi.de/entity/Q49684342019-07-12Paper
https://portal.mardi4nfdi.de/entity/Q46226112019-02-13Paper
Orientable \(\mathbb{Z}_N\)-distance magic graphs2019-02-07Paper
https://portal.mardi4nfdi.de/entity/Q45598962018-12-04Paper
A note on incomplete regular tournaments with handicap two of order n≡8(mod 16)2018-10-23Paper
A note on nearly platonic graphs2018-04-10Paper
On regular handicap graphs of even order2018-01-04Paper
https://portal.mardi4nfdi.de/entity/Q45951932017-11-29Paper
https://portal.mardi4nfdi.de/entity/Q45908932017-11-20Paper
https://portal.mardi4nfdi.de/entity/Q29712272017-04-04Paper
Decomposition of certain complete bipartite graphs into prisms2017-01-23Paper
Group distance magic and antimagic graphs2016-11-02Paper
In memoriam: Emeritus Professor Mirka Miller (09-05-1949--02-01-2016)2016-10-31Paper
Vertex magic total labelings of 2-regular graphs2016-10-21Paper
Group distance magic and antimagic graphs2016-10-17Paper
Alpha labelings of full hexagonal caterpillars2016-10-14Paper
Distance magic Cartesian products of graphs2016-04-25Paper
Distance magic circulant graphs2015-10-08Paper
https://portal.mardi4nfdi.de/entity/Q52519572015-05-21Paper
Decomposition of complete graphs into (0, 2)-prisms2015-01-27Paper
https://portal.mardi4nfdi.de/entity/Q28754772014-08-15Paper
Some open problems on graph labelings2014-04-07Paper
Decomposition of complete graphs into small generalized prisms2014-04-07Paper
Handicap distance antimagic graphs and incomplete tournaments2014-04-07Paper
The odd harmonious labeling of dumbbell and generalised prism graphs2014-04-07Paper
https://portal.mardi4nfdi.de/entity/Q54054872014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54032722014-03-25Paper
https://portal.mardi4nfdi.de/entity/Q54032742014-03-25Paper
https://portal.mardi4nfdi.de/entity/Q28693012014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q28693402014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q28694632014-01-03Paper
Decomposition of complete bipartite graphs into generalized prisms2012-11-15Paper
https://portal.mardi4nfdi.de/entity/Q31101292012-01-26Paper
Factorizations of complete graphs into trees with at most four non-leave vertices2012-01-24Paper
Rectangular table negotiation problem revisited2012-01-16Paper
https://portal.mardi4nfdi.de/entity/Q30892042011-08-24Paper
Decomposition of complete graphs into small graphs2011-07-18Paper
https://portal.mardi4nfdi.de/entity/Q30125852011-07-06Paper
https://portal.mardi4nfdi.de/entity/Q29951622011-04-20Paper
Recent advances in Rosa-type labelings of graphs2011-02-08Paper
https://portal.mardi4nfdi.de/entity/Q35819032010-09-02Paper
Super edge-graceful paths2010-09-02Paper
Factorization of \(K_{n,n}\) into \((0,j)\)-prisms2010-08-20Paper
α2-labeling of graphs2010-05-25Paper
Decompositions of complete graphs into blown-up cycles \(C_m\)[2]2010-04-27Paper
Factorizations of complete graphs into caterpillars of diameter 52010-03-29Paper
Note on Decomposition of K n,n into (0,j)-prisms2009-12-11Paper
Product rosy labeling of graphs2009-06-23Paper
https://portal.mardi4nfdi.de/entity/Q36249622009-05-06Paper
https://portal.mardi4nfdi.de/entity/Q36205292009-04-14Paper
Oberwolfach rectangular table negotiation problem2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q54431922008-02-20Paper
On biclique coverings2008-01-30Paper
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem2007-07-30Paper
Orthogonal double covers of complete graphs by caterpillars of diameter 52007-05-10Paper
Bi-cyclic decompositions of complete graphs into spanning trees2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34294882007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q34239822007-02-15Paper
https://portal.mardi4nfdi.de/entity/Q34108552006-11-16Paper
https://portal.mardi4nfdi.de/entity/Q33783432006-03-30Paper
https://portal.mardi4nfdi.de/entity/Q57089982005-11-21Paper
https://portal.mardi4nfdi.de/entity/Q57023232005-11-01Paper
Pancomponented 2-factorizations of complete graphs2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q46778932005-05-23Paper
Cyclic decompositions of complete graphs into spanning trees2005-04-15Paper
On traceability and 2-factors in claw-free graphs2004-10-27Paper
Some remarks on domination2004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44252262004-01-14Paper
https://portal.mardi4nfdi.de/entity/Q44056592003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q45295242003-08-21Paper
https://portal.mardi4nfdi.de/entity/Q44057892003-06-23Paper
Self-complementary factors of almost complete tripartite graphs of even order2002-11-24Paper
https://portal.mardi4nfdi.de/entity/Q45513812002-09-05Paper
https://portal.mardi4nfdi.de/entity/Q45521742002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q43291112002-04-29Paper
On seed graphs with more than two components2002-04-16Paper
Corrigendum to ``Almost self-complementary factors of complete bipartite graphs. [Discrete Math. 167/168 (1997), 317-327]2002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27125272001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q27166182001-10-15Paper
https://portal.mardi4nfdi.de/entity/Q45031082001-01-04Paper
https://portal.mardi4nfdi.de/entity/Q49487372000-12-13Paper
https://portal.mardi4nfdi.de/entity/Q45050082000-09-25Paper
https://portal.mardi4nfdi.de/entity/Q44870832000-09-04Paper
Note on cyclic decompositions of complete bipartite graphs into cubes2000-08-27Paper
2-halvable complete 4-partite graphs2000-04-09Paper
https://portal.mardi4nfdi.de/entity/Q49378092000-03-27Paper
https://portal.mardi4nfdi.de/entity/Q38397221998-08-09Paper
Almost self-complementary factors of complete bipartite graphs1997-10-08Paper
The existence of selfcomplementary circulant graphs1997-08-17Paper
Decompositions of complete bipartite and tripartite graphs into selfcomplementary factors with finite diameters1997-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48711591996-08-20Paper
https://portal.mardi4nfdi.de/entity/Q48767431996-05-06Paper
https://portal.mardi4nfdi.de/entity/Q48487701995-09-20Paper
e-realization of double-stars1994-04-04Paper
https://portal.mardi4nfdi.de/entity/Q40271551993-02-21Paper
GRAPHS WITH CONSTANT NEIGHBOURHOODS OF TWO INDEPENDENT VERTICES1993-02-18Paper
https://portal.mardi4nfdi.de/entity/Q40215861993-01-16Paper
Edge-realizable graphs with universal vertices1992-06-26Paper
Graphs with near v- and e-neighbourhoods1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q30322951989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153481989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47298201989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q52022201989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Dalibor Fronček