M. Meszka

collaborators

2 papers

math.CO2022

A note on the conflict-free chromatic index

Mateusz Kamyczura, Mariusz Meszka, Jakub Przybyło

Let $G$ be a graph with maximum degree $Δ$ and without isolated vertices. An edge colouring $c$ of $G$ is conflict-free if the closed neighbourhood of every edge includes a uniquel…

math.CO2017

Almost 2-perfect 8-cycle systems

Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan +1

For an $m$ -cycle $C$ , an inside $m$ -cycle of $C$ is a cycle on the same vertex set, that is edge-disjoint from $C$ . In an $m$ -cycle system, $(X, C)$ , if inside…