Petr Kovár

22 papers C 2Journal 18Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
On 14-regular distance magic graphs.
Electron. J. Graph Theory Appl.
Petr Kovár, Matéj Krbecek
2024 J jnl
On vertex in-out-antimagic total digraphs.
Discret. Math.
Martin Baca, Petr Kovár, Tereza Kovárová, Andrea Semanicová-Fenovcíková
2023 — conf
Covering Complete Graphs using the Dancing Links Algorithm.
ITAT
Petr Kovár, Yifan Zhang
2022 J jnl
Design of Fiber Bragg Grating Sensor Networks.
IEEE Trans. Instrum. Meas.
Marcel Fajkus, Petr Kovár, Jan Skapa, Jan Nedoma, Radek Martinek, Vladimir Vasinek
2021 J jnl
Supermagic graphs with many different degrees.
Discuss. Math. Graph Theory
Petr Kovár, Michal Kravcenko, Matéj Krbecek, Adam Silber
2020 J jnl
How N-(pyridin-4-yl)pyridin-4-amine and its methyl and nitro derivatives are arranged in the interlayer space of zirconium sulfophenylphosphonate: a problem solved by experimental and calculation methods.
J. Comput. Aided Mol. Des.
Petr Kovár, Jakub Skoda, Miroslav Pospísil, Klára Melánová, Jan Svoboda, Ludvík Benes, Petr Kutálek, Vítezslav Zima, Filip Bures
2017 J jnl
On regular handicap graphs of even order.
Electron. Notes Discret. Math.
Dalibor Froncek, Petr Kovár, Tereza Kovárová, Bohumil Krajc, Michal Kravcenko, Aaron Shepanik, Adam Silber
2015 J jnl
A parallel fast boundary element method using cyclic graph decompositions.
Numer. Algorithms
Dalibor Lukás, Petr Kovár, Tereza Kovárová, Michal Merta
2013 J jnl
Decomposition of complete bipartite graphs into generalized prisms.
Eur. J. Comb.
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
2013 J jnl
Distance magic labelings of hypercubes.
Electron. Notes Discret. Math.
Petr Gregor, Petr Kovár
2012 J jnl
A note on 4-regular distance magic graphs.
Australas. J Comb.
Petr Kovár, Tereza Kovárová, Dalibor Froncek
2012 J jnl
Factorizations of complete graphs into brooms.
Discret. Math.
Petr Kovár, Michael Kubesa, Mariusz Meszka
2011 — ch.
Decompositions and Factorizations of Complete Graphs.
Structural Analysis of Complex Networks
Petr Kovár
2011 J jnl
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices.
Graphs Comb.
Dalibor Froncek, Petr Kovár, Michael Kubesa
2010 J jnl
Decompositions of complete graphs into blown-up cycles C
Discret. Math.
Dalibor Froncek, Petr Kovár, Michael Kubesa
2010 J jnl
Factorizations of complete graphs into caterpillars of diameter 5.
Discret. Math.
Dalibor Froncek, Petr Kovár, Tereza Kovárová, Michael Kubesa
2010 J jnl
On super (a, 1)-edge-antimagic total labelings of regular graphs.
Discret. Math.
Martin Baca, Petr Kovár, Andrea Semanicová-Fenovcíková, Muhammad Kashif Shafiq
2009 C conf
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees.
IWOCA
Petr Kovár, Michael Kubesa
2009 C conf
Note on Decomposition of
IWOCA
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
2008 J jnl
On biclique coverings.
Discret. Math.
Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár
2007 J jnl
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem.
Comb. Probab. Comput.
Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár
2005 J jnl
Vertex magic total labeling of products of cycles.
Australas. J Comb.
Dalibor Froncek, Petr Kovár, Tereza Kovárová