default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Lukot'ka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Robert Lukotka:
Circular flow number of Goldberg snarks. Discret. Math. 347(3): 113792 (2024)- 2022
- [j20]Robert Lukotka
, Edita Rollová:
Perfect matchings in highly cyclically connected regular graphs. J. Graph Theory 100(1): 28-49 (2022) - 2021
- [j19]Robert Lukotka:
Determining the Circular Flow Number of a Cubic Graph. Electron. J. Comb. 28(1): 1 (2021) - 2020
- [j18]Anna Kompisová, Robert Lukot'ka:
Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two. Electron. J. Comb. 27(4): 4 (2020) - [j17]Robert Lukotka:
Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits. SIAM J. Discret. Math. 34(1): 188-211 (2020)
2010 – 2019
- 2019
- [j16]Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová:
Shorter signed circuit covers of graphs. J. Graph Theory 92(1): 39-56 (2019) - [i7]Robert Lukotka:
Short cycle covers of cubic graphs and intersecting 5-circuits. CoRR abs/1901.10718 (2019) - 2018
- [j15]Robert Lukotka, Ján Mazák:
Simple cubic graphs with no short traveling salesman tour. Discret. Appl. Math. 244: 218-222 (2018) - [j14]Robert Lukot'ka, Ján Mazák:
Weak oddness as an approximation of oddness and resistance in cubic graphs. Discret. Appl. Math. 244: 223-226 (2018) - [j13]Barbora Duník, Robert Lukotka:
Cubic TSP: A 1.3-Approximation. SIAM J. Discret. Math. 32(3): 2094-2114 (2018) - 2017
- [j12]Robert Lukot'ka, Edita Rollová:
Perfect Matchings of Regular Bipartite Graphs. J. Graph Theory 85(2): 525-532 (2017) - [i6]Robert Lukotka, Ján Mazák:
Simple cubic graphs with no short traveling salesman tour. CoRR abs/1712.10167 (2017) - 2016
- [j11]Barbora Candráková, Robert Lukotka:
Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor. SIAM J. Discret. Math. 30(4): 2086-2106 (2016) - [i5]Robert Lukotka, Ján Mazák:
Weak oddness as an approximation of oddness and resistance in cubic graphs. CoRR abs/1602.02949 (2016) - 2015
- [j10]Robert Lukotka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small Snarks with Large Oddness. Electron. J. Comb. 22(1): 1 (2015) - [j9]Robert Lukot'ka, Ján Mazák, Xuding Zhu:
Maximum 4-Degenerate Subgraph of a Planar Graph. Electron. J. Comb. 22(1): 1 (2015) - [j8]Barbora Candráková, Robert Lukot'ka:
Avoiding 5-Circuits in 2-Factors of Cubic Graphs. SIAM J. Discret. Math. 29(3): 1387-1405 (2015) - [i4]Barbora Candráková, Robert Lukotka:
Cubic TSP - a 1.3-approximation. CoRR abs/1506.06369 (2015) - 2014
- [j7]Robert Lukotka:
Avoiding 7-Circuits in 2-Factors of Cubic Graphs. Electron. J. Comb. 21(4): 4 (2014) - [j6]Robert Lukot'ka:
Acyclic 4-edge colouring of non-regular subcubic graphs in linear time. Discret. Appl. Math. 170: 110-112 (2014) - 2013
- [j5]Robert Lukot'ka:
Circular flow number of generalized Blanuša snarks. Discret. Math. 313(8): 975-981 (2013) - [i3]Robert Lukotka, Ján Mazák, Xuding Zhu:
Maximum 4-degenerate subgraph of a planar graph. CoRR abs/1305.6195 (2013) - [i2]Barbora Candráková, Robert Lukotka:
Avoiding 5-circuits in a 2-factor of cubic graphs. CoRR abs/1311.0512 (2013) - 2012
- [j4]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Circuits of length 5 in 2-factors of cubic graphs. Discret. Math. 312(14): 2131-2134 (2012) - [i1]Robert Lukot'ka, Edita Mácajová, Ján Mazák, Martin Skoviera:
Small snarks with large oddness. CoRR abs/1212.3641 (2012) - 2011
- [j3]Robert Lukot'ka, Martin Skoviera:
Snarks with given real flow numbers. J. Graph Theory 68(3): 189-201 (2011) - 2010
- [j2]Robert Lukot'ka, Ján Mazák:
Cubic Graphs with Given Circular Chromatic Index. SIAM J. Discret. Math. 24(3): 1091-1103 (2010)
2000 – 2009
- 2008
- [j1]Robert Lukot'ka, Martin Skoviera:
Real flow number and the cycle rank of a graph. J. Graph Theory 59(1): 11-16 (2008)
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 2025-01-09 13:15 CET 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:
