C. Picouleau

most citedCritical Vertices and Edges in

H

-free Graphs

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

collaborators

3 papers

math.CO2017

Adaptive Network Flow with $k$ -Arc Destruction

Thomas Ridremont, Dimitri Watel, Pierre-Louis Poirion +1

When a flow is not allowed to be reoriented the Maximum Residual Flow Problem with $k$ -Arc Destruction is known to be $N P$ -hard for $k = 2$ . We show that when a flow is allowed to be…

cs.DS2017

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs

Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau +1

We study the following problem: for given integers $d$ , $k$ and graph $G$ , can we reduce some fixed graph parameter $π$ of $G$ by at least $d$ via at most $k$ graph operations from…

cs.CC2017★ 1 cited

Critical Vertices and Edges in $H$ -free Graphs

Daniël Paulusma, Christophe Picouleau, Bernard Ries

A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex o…

Adaptive Network Flow with k-Arc Destruction

Contraction and Deletion Blockers for Perfect Graphs and H-free Graphs

Critical Vertices and Edges in H-free Graphs

Adaptive Network Flow with $k$ -Arc Destruction

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs

Critical Vertices and Edges in $H$ -free Graphs