Aikaterini Niklanovits

activity

20202026

most citedCombining Crown Structures for Vulnerability Measures

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Connected Partitions via Connected Dominating Sets

Aikaterini Niklanovits, Kirill Simonov, Shaily Verma +1

The classical theorem due to Győri and Lovász states that any $k$ -connected graph $G$ admits a partition into $k$ connected subgraphs, where each subgraph has a prescribed size and…

math.CO2021

Connected $k$ -partition of $k$ -connected graphs and $c$ -claw-free graphs

Ralf Borndörfer, Katrin Casel, Davis Issac +3

A connected partition is a partition of the vertices of a graph into sets that induce connected subgraphs. Such partitions naturally occur in many application areas such as road ne…

Connected Partitions via Connected Dominating Sets

Connected k-partition of k-connected graphs and c-claw-free graphs

Connected $k$ -partition of $k$ -connected graphs and $c$ -claw-free graphs