Edita Máčajová

activity

20092025

most citedStrong edge colorings of graphs and the covers of Kneser graphs

12 citations · 41 across the 15 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Cubic graphs with colouring defect 3

Ján Karabáš, Edita Máčajová, Roman Nedela +1

The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$ -edge-colourable graphs have defect $0$ , those…

math.CO2023★ 1 cited

Three-cuts are a charm: acyclicity in 3-connected cubic graphs

František Kardoš, Edita Máčajová, Jean Paul Zerafa

Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_{4}$ -Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchi…

math.CO2023

The Frank number and nowhere-zero flows on graphs

Jan Goedgebeur, Edita Máčajová, Jarne Renders

An edge $e$ of a graph $G$ is called deletable for some orientation $o$ if the restriction of $o$ to $G - e$ is a strong orientation. Inspired by a problem of Frank, in 2021 Hörsch a…