Selda Küçükçi̇fçi̇

activity

20132026

most citedMaximum uniformly resolvable decompositions of

K_{v}

and

K_{v} - I

into 3-stars and 3-cycles

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2026

Globally Simple Heffter Arrays $H (n; k)$ with $k \equiv 1 (mod 4)$

Erik Pelttari, Selda Küçükçifçi, E. Şule Yazıcı

Heffter arrays are combinatorial structures used to construct orthogonal cyclic cycle decompositions and biembeddings of complete graphs onto surfaces. A Heffter array $H (m, n; h, k)$ …

math.CO2023

Orthogonal cycle systems with cycle length less than 10

Selda Kucukcifci, E. Sule Yazici

An $H$ -decomposition of $G$ is a partition of the edge-set of $G$ into subsets, where each subset induces a copy of the graph $H$ . A $k$ -orthogonal $H$ -decomposition of a graph $G$ …

math.CO2014

Resolvable 3-star designs

Selda Kucukcifci, Giovanni Lo faro, Salvatore Milici +1

Let Kv be the complete graph of order v and F be a set of 1-factors of Kv. In this article we study the existence of a resolvable decomposition of Kv - F into 3-stars when F has th…

math.CO2013★ 1 cited

Maximum uniformly resolvable decompositions of $K_{v}$ and $K_{v} - I$ into 3-stars and 3-cycles

Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza

Let $K_{v}$ denote the complete graph of order $v$ and $K_{v} - I$ denote $K_{v}$ minus a 1-factor. In this article we investigate uniformly resolvable decompositions of $K_{v}$ and $K_v-I…

Globally Simple Heffter Arrays H(n;k) with k≡1(mod4)

Orthogonal cycle systems with cycle length less than 10

Resolvable 3-star designs

Maximum uniformly resolvable decompositions of Kv​ and Kv​−I into 3-stars and 3-cycles

Globally Simple Heffter Arrays $H (n; k)$ with $k \equiv 1 (mod 4)$

Maximum uniformly resolvable decompositions of $K_{v}$ and $K_{v} - I$ into 3-stars and 3-cycles