Malory Marin

activity

20232026

most citedChannel allocation revisited through 1-extendability of graphs

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2024

A structural description of Zykov and Blanche Descartes graphs

Malory Marin, Stéphan Thomassé, Nicolas Trotignon +1

In 1949, Zykov proposed the first explicit construction of triangle-free graphs with arbitrarily large chromatic number. We define a Zykov graph as any induced subgraph of a graph…

math.CO2024

Beyond recognizing well-covered graphs

Carl Feghali, Malory Marin, Rémi Watrigant

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is sa…

math.CO2023

Three remarks on $W_{2}$ graphs

Carl Feghali, Malory Marin

Let $k \geq 1$ . A graph $G$ is $W_{k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_{1}, \dots, A_{k}$ in $G$ , there exist $k$ pairwise disjoint maximum indepe…

A structural description of Zykov and Blanche Descartes graphs

Beyond recognizing well-covered graphs

Three remarks on W2​ graphs

Three remarks on $W_{2}$ graphs