Irena Penev

activity

20172019

collaborators

3 papers

math.CO2019

Coloring rings

Frédéric Maffray, Irena Penev, Kristina Vušković

A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_{1}, \dots, X_{k}$ , such that for all $i \in {1, \dots, k}$ , the set $X_{i}$ can be ordered as…

math.CO2018

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness

Kathie Cameron, Shenwei Huang, Irena Penev +1

As usual, $P_{n}$ ( $n \geq 1$ ) denotes the path on $n$ vertices, and $C_{n}$ ( $n \geq 3$ ) denotes the cycle on $n$ vertices. For a family $H$ of graphs, we say that a graph $…

math.CO2017

Clique-cutsets beyond chordal graphs

Valerio Boncompagni, Irena Penev, Kristina Vuskovic

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (e.g. the class of perfect graphs and…

Coloring rings

The class of (P7​,C4​,C5​)-free graphs: decomposition, algorithms, and χ-boundedness

Clique-cutsets beyond chordal graphs

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness