Robert Lukot'ka

Discret. Math., March, 2024

2022

Perfect matchings in highly cyclically connected regular graphs.

[BibT_eX]

[DOI]

Edita Rollová

J. Graph Theory, 2022

2021

Determining the Circular Flow Number of a Cubic Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2020

Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two.

[BibT_eX]

[DOI]

Anna Kompisová

Electron. J. Comb., 2020

2019

Shorter signed circuit covers of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

2018

Cubic TSP: A 1.3-Approximation.

[BibT_eX]

[DOI]

Barbora Duník

SIAM J. Discret. Math., 2018

Weak oddness as an approximation of oddness and resistance in cubic graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Simple cubic graphs with no short traveling salesman tour.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Perfect Matchings of Regular Bipartite Graphs.

[BibT_eX]

[DOI]

Edita Rollová

J. Graph Theory, 2017

2016

Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

2015

Avoiding 5-Circuits in 2-Factors of Cubic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Cubic TSP - a 1.3-approximation.

[BibT_eX]

[DOI]

CoRR, 2015

Maximum 4-Degenerate Subgraph of a Planar Graph.

[BibT_eX]

[DOI]

Xuding Zhu

Electron. J. Comb., 2015

Small Snarks with Large Oddness.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Acyclic 4-edge colouring of non-regular subcubic graphs in linear time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Avoiding 7-Circuits in 2-Factors of Cubic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

Circular flow number of generalized Blanuša snarks.

[BibT_eX]

[DOI]

Discret. Math., 2013

Avoiding 5-circuits in a 2-factor of cubic graphs.

[BibT_eX]

[DOI]

CoRR, 2013

2012

Circuits of length 5 in 2-factors of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

Snarks with given real flow numbers.

[BibT_eX]

[DOI]

Martin Skoviera

J. Graph Theory, 2011

2010

Cubic Graphs with Given Circular Chromatic Index.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

2008

Real flow number and the cycle rank of a graph.

[BibT_eX]

[DOI]