Finding Minimum Matching Cuts in $H$-free Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lucke, Felicia, Marchand, Joseph, Olbrich, Jannik
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Computational Complexity Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2502.18942