On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ghanbari, Babak, Šámal, Robert
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2503.00263