On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs

Lecture notes in computer science 2026

View at publisher
Authors: Babak Ghanbari, Robert Šámal
DOI: 10.1007/978-3-032-11835-6_16
Cited by: 0
References: 11

Fields of Study & Subjects

Advanced Graph Theory Research Complexity and Algorithms in Graphs Computational Geometry and Mesh Generation

Publication details

Journal / source
Lecture notes in computer science
Pages
219–229
Publication date
1 January 2026
Language
EN