A. Czygrinow

activity

20042026

most citedOn Odd Rainbow Cycles in Edge-Colored Graphs

11 citations · 17 across the 15 of their papers we have counts for

collaborators

20 papers

math.CO2026

Rainbow cycles in triangle-free graphs

Andrzej Czygrinow, Skand Parvatikar

Let $G = (V, E)$ be an edge-colored graph, and let $δ^{c} (G) = min_{v \in V} {d^{c} (v)}$ where $d^{c} (v)$ is the number of colors on edges incident to a vertex $v$ . We show that fo…

math.CO2024

Tight minimum colored degree condition for rainbow connectivity

Andrzej Czygrinow, Xiaofan Yuan

Let $G = (V, E)$ be a graph on $n$ vertices, and let $c : E \to P$ , where $P$ is a set of colors. Let $δ^{c} (G) = min_{v \in V} {d^{c} (v)}$ where $d^{c} (v)$ is the number of colors…

math.CO2024

Rainbow Cliques in Edge-Colored Graphs

Andrzej Czygrinow, Theodore Molla, Brendan Nagle

Let $G = (V, E)$ be an $n$ -vertex graph and let $c : E \to N$ be a coloring of its edges. Let $d^{c} (v)$ be the number of distinct colors on the edges at $v \in V$ and let $δ^…

cs.DS2022

Distributed distance domination in graphs with no $K_{2, t}$ -minor

Andrzej Czygrinow, Michał Hanćkowiak, Marcin Witkowski

We prove that a simple distributed algorithm finds a constant approximation of an optimal distance- $k$ dominating set in graphs with no $K_{2, t}$ -minor. The algorithm runs in a con…

math.CO2019

On Even Rainbow or Nontriangular Directed Cycles

Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1

Let $G = (V, E)$ be an $n$ -vertex edge-colored graph. In 2013, H. Li proved that if every vertex $v \in V$ is incident to at least $(n + 1) /2$ distinctly colored edges, then $G$ admi…

math.CO2019★ 11 cited

On Odd Rainbow Cycles in Edge-Colored Graphs