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 2021Show all

3 papers · 1 filter

math.CO2021

Decomposition of cubic graphs with cyclic connectivity 5

Edita Máčajová, Jozef Rajník

Let $G$ be a cyclically $5$ -connected cubic graph with a $5$ -edge-cut separating $G$ into two cyclic components $G_{1}$ and $G_{2}$ . We prove that each component $G_{i}$ can be completed…

math.CO2021

Girth, oddness, and colouring defect of snarks

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

The colouring defect of a cubic graph, introduced by Steffen in 2015, is the minimum number of edges that are left uncovered by any set of three perfect matchings. Since a cubic gr…

math.CO2021★ 12 cited

Strong edge colorings of graphs and the covers of Kneser graphs

Borut Lužar, Edita Mačajová, Martin Škoviera +1

A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a $k$ -regular graph at least $2k-…