Edita M'avcajov'a

collaborators

4 papers

math.CO2026

On $4$ -covers of cubic graphs with two adjacent odd circuits in a $2$ -factor

JÃ¡n KarabÃ¡Å¡, Edita MÃ¡ÄajovÃ¡

Let $G$ be a cubic graph admitting a $2$ -factor consisting of exactly two odd circuits, and let the complementary $1$ -factor contain precisely three spokes (along with an arbitrary…

math.CO2025

Cages and cyclic connectivity

Robert LukoÅ¥ka, Edita MÃ¡ÄajovÃ¡, Jozef RajnÃk

A graph $G$ is cyclically $c$ -edge-connected if there is no set of fewer than $c$ edges that disconnects $G$ into at least two cyclic components. We prove that if a $(k, g)$ -cage $…

math.CO2025

Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi

JÃ¡n KarabÃ¡Å¡, Edita MÃ¡ÄajovÃ¡, Roman Nedela +1

We study two measures of uncolourability of cubic graphs, their colouring defect and perfect matching index. The colouring defect of a cubic graph $G$ is the smallest number of edg…

math.CO2025

Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson

JÃ¡n KarabÃ¡Å¡, Edita MÃ¡ÄajovÃ¡, Roman Nedela +1

We introduce a new invariant of a cubic graph - its regular colouring defect - which is defined as the smallest number of edges left uncovered by any collection of three perfect ma…

On 4-covers of cubic graphs with two adjacent odd circuits in a 2-factor

Cages and cyclic connectivity

Cubic graphs of colouring defect 3 and conjectures of Berge and Alon-Tarsi

Regular colouring defect of a cubic graph and the conjectures of Fan-Raspaud and Fulkerson

On $4$ -covers of cubic graphs with two adjacent odd circuits in a $2$ -factor