Real flow number and the cycle rank of a graph. - Robert Lukot'ka; Martin Skoviera (J. Graph Theory, 2008)

Cubic Graphs with Given Circular Chromatic Index. - Robert Lukot'ka; Ján Mazák (SIAM J. Discret. Math., 2010)

Snarks with given real flow numbers. - Robert Lukot'ka; Martin Skoviera (J. Graph Theory, 2011)

Circuits of length 5 in 2-factors of cubic graphs. - Robert Lukot'ka; Edita Mácajová; Ján Mazák; Martin Skoviera (Discret. Math., 2012)

Avoiding 5-circuits in a 2-factor of cubic graphs. - Barbora Candráková; Robert Lukotka (CoRR, 2013)

Circular flow number of generalized Blanuša snarks. - Robert Lukot'ka (Discret. Math., 2013)

Avoiding 7-Circuits in 2-Factors of Cubic Graphs. - Robert Lukotka (Electron. J. Comb., 2014)

Acyclic 4-edge colouring of non-regular subcubic graphs in linear time. - Robert Lukot'ka (Discret. Appl. Math., 2014)

Small Snarks with Large Oddness. - Robert Lukotka; Edita Mácajová; Ján Mazák; Martin Skoviera (Electron. J. Comb., 2015)

Maximum 4-Degenerate Subgraph of a Planar Graph. - Robert Lukot'ka; Ján Mazák; Xuding Zhu (Electron. J. Comb., 2015)

Cubic TSP - a 1.3-approximation. - Barbora Candráková; Robert Lukotka (CoRR, 2015)

Avoiding 5-Circuits in 2-Factors of Cubic Graphs. - Barbora Candráková; Robert Lukot'ka (SIAM J. Discret. Math., 2015)

Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor. - Barbora Candráková; Robert Lukotka (SIAM J. Discret. Math., 2016)

Perfect Matchings of Regular Bipartite Graphs. - Robert Lukot'ka; Edita Rollová (J. Graph Theory, 2017)

Simple cubic graphs with no short traveling salesman tour. - Robert Lukotka; Ján Mazák (Discret. Appl. Math., 2018)

Weak oddness as an approximation of oddness and resistance in cubic graphs. - Robert Lukot'ka; Ján Mazák (Discret. Appl. Math., 2018)

Cubic TSP: A 1.3-Approximation. - Barbora Duník; Robert Lukotka (SIAM J. Discret. Math., 2018)

Shorter signed circuit covers of graphs. - Tomás Kaiser; Robert Lukot'ka; Edita Mácajová; Edita Rollová (J. Graph Theory, 2019)

Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two. - Anna Kompisová; Robert Lukot'ka (Electron. J. Comb., 2020)

Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits. - Robert Lukotka (SIAM J. Discret. Math., 2020)

Determining the Circular Flow Number of a Cubic Graph. - Robert Lukotka (Electron. J. Comb., 2021)

Perfect matchings in highly cyclically connected regular graphs. - Robert Lukotka; Edita Rollová (J. Graph Theory, 2022)

Circular flow number of Goldberg snarks. - Robert Lukotka (Discret. Math., 2024)