default search action
Petr Kovár
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j18]Martin Baca, Petr Kovár
, Tereza Kovárová, Andrea Semanicová-Fenovcíková:
On vertex in-out-antimagic total digraphs. Discret. Math. 347(8): 113758 (2024) - [j17]Petr Kovár
On 14-regular distance magic graphs. Electron. J. Graph Theory Appl. 12(1): 35-41 (2024) - 2022
- [j16]Marcel Fajkus
Design of Fiber Bragg Grating Sensor Networks. IEEE Trans. Instrum. Meas. 71: 1-11 (2022) - 2021
- [j15]Petr Kovár, Michal Kravcenko, Matéj Krbecek, Adam Silber:
Supermagic graphs with many different degrees. Discuss. Math. Graph Theory 41(4): 1041-1050 (2021) - 2020
- [j14]Petr Kovár, Jakub Skoda, Miroslav Pospísil
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. 34(6): 683-695 (2020) - 2017
- [j13]Dalibor Froncek
On regular handicap graphs of even order. Electron. Notes Discret. Math. 60: 69-76 (2017) - 2015
- [j12]Dalibor Lukás
A parallel fast boundary element method using cyclic graph decompositions. Numer. Algorithms 70(4): 807-824 (2015) - 2013
- [j11]Sylwia Cichacz
Decomposition of complete bipartite graphs into generalized prisms. Eur. J. Comb. 34(1): 104-110 (2013) - [j10]Petr Gregor
Distance magic labelings of hypercubes. Electron. Notes Discret. Math. 40: 145-149 (2013) - 2012
- [j9]Petr Kovár, Tereza Kovárová, Dalibor Froncek:
A note on 4-regular distance magic graphs. Australas. J Comb. 54: 127-132 (2012) - [j8]Petr Kovár
Factorizations of complete graphs into brooms. Discret. Math. 312(6): 1084-1093 (2012) - 2011
- [j7]Dalibor Froncek
Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices. Graphs Comb. 27(5): 621-646 (2011) - 2010
- [j6]Dalibor Froncek
Factorizations of complete graphs into caterpillars of diameter 5. Discret. Math. 310(3): 537-556 (2010) - [j5]Dalibor Froncek
Decompositions of complete graphs into blown-up cycles Cm[2]. Discret. Math. 310(5): 1003-1015 (2010) - [j4]Martin Baca
On super (a, 1)-edge-antimagic total labelings of regular graphs. Discret. Math. 310(9): 1408-1412 (2010) - 2008
- [j3]Sergei L. Bezrukov, Dalibor Froncek
On biclique coverings. Discret. Math. 308(2-3): 319-323 (2008) - 2007
- [j2]Dalibor Froncek
Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem. Comb. Probab. Comput. 16(2): 271-275 (2007) - 2005
- [j1]Dalibor Froncek, Petr Kovár, Tereza Kovárová:
Vertex magic total labeling of products of cycles. Australas. J Comb. 33: 169-182 (2005)
Conference and Workshop Papers
- 2023
- [c3]Petr Kovár, Yifan Zhang:
Covering Complete Graphs using the Dancing Links Algorithm. ITAT 2023: 161-167 - 2009
- [c2]Sylwia Cichacz
Note on Decomposition of Kn, n into (0, j)-prisms. IWOCA 2009: 125-133 - [c1]Petr Kovár
Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees. IWOCA 2009: 334-344
Parts in Books or Collections
- 2011
- [p1]Petr Kovár
Decompositions and Factorizations of Complete Graphs. Structural Analysis of Complex Networks 2011: 169-196
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-07-05 20:19 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: