2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2021
Circular flow number of Goldberg snarks
Robert Lukoťka
A circular nowhere-zero -flow on a bridgeless graph is an orientation of the edges and an assignment of real values from to the edges in such a way that the sum o…
math.CO2019
Short cycle covers of cubic graphs and intersecting 5-circuits
Robert Lukoťka
A cycle cover of a graph is a collection of cycles such that each edge of the graph is contained in at least one of the cycles. The length of a cycle cover is the sum of all cycle…
math.CO2017
Shorter signed circuit covers of graphs
Tomáš Kaiser, Robert Lukot'ka, Edita Máčajová +1
A signed circuit is a minimal signed graph (with respect to inclusion) that admits a nowhere-zero flow. We show that each flow-admissible signed graph on edges can be covered b…