 | 2012 |
|---|
| 9 |       | Petr Kovár,
Michael Kubesa,
Mariusz Meszka:
Factorizations of complete graphs into brooms.
Discrete Mathematics 312(6): 1084-1093 (2012) |
| 2011 |
|---|
| 8 | | Dalibor Froncek,
Petr Kovár,
Michael Kubesa:
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.
Graphs and Combinatorics 27(5): 621-646 (2011) |
| 2010 |
|---|
| 7 | | Dalibor Froncek,
Petr Kovár,
Tereza Kovarova,
Michael Kubesa:
Factorizations of complete graphs into caterpillars of diameter 5.
Discrete Mathematics 310(3): 537-556 (2010) |
| 6 | | Dalibor Froncek,
Petr Kovár,
Michael Kubesa:
Decompositions of complete graphs into blown-up cycles Cm[2].
Discrete Mathematics 310(5): 1003-1015 (2010) |
| 5 | | Martin Baca,
Petr Kovár,
Andrea Semanicová-Fenovcíková,
Muhammad Kashif Shafiq:
On super (a, 1)-edge-antimagic total labelings of regular graphs.
Discrete Mathematics 310(9): 1408-1412 (2010) |
| 2009 |
|---|
| 4 | | Sylwia Cichacz,
Dalibor Froncek,
Petr Kovár:
Note on Decomposition of Kn, n into (0, j)-prisms.
IWOCA 2009: 125-133 |
| 3 | | Petr Kovár,
Michael Kubesa:
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.
IWOCA 2009: 334-344 |
| 2008 |
|---|
| 2 | | Sergei L. Bezrukov,
Dalibor Froncek,
Steven J. Rosenberg,
Petr Kovár:
On biclique coverings.
Discrete Mathematics 308(2-3): 319-323 (2008) |
| 2007 |
|---|
| 1 | | Dalibor Froncek,
Janja Jerebic,
Sandi Klavzar,
Petr Kovár:
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
Combinatorics, Probability & Computing 16(2): 271-275 (2007) |
Data released under the ODC-BY 1.0 license — See also our legal information page