Valentin Bouquet

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Partition of graphs with maximum degree ratio
Annals of Operations Research
2025-08-09Paper
The complexity of the perfect matching-cut problem
Journal of Graph Theory
2025-01-20Paper
On the complexity of Dominating Set for graphs with fixed diameter2023-04-19Paper
The bondage number of chordal graphs2022-03-17Paper
The complexity of the bondage problem in planar graphs2021-07-23Paper
The complexity of the Perfect Matching-Cut problem2020-11-06Paper
On the vertices belonging to all, some, none minimum dominating set
Discrete Applied Mathematics
2020-11-02Paper
Partition of graphs with maximum degree ratio2020-07-24Paper
On Minimum Dominating Sets in cubic and (claw,H)-free graphs2020-02-27Paper
The Minimum Dominating Set problem is polynomial for (claw, P8)-free graphs2020-01-21Paper


Research outcomes over time


This page was built for person: Valentin Bouquet