The Complexity of Decomposing a Graph into a Matching and a Bounded Linear Forest

Banerjee, Agnijo; Marciano, Joao Pedro; Mond, Adva ✉; Petr, Jan; Portier, Julien

English Article (Journal Article) Scientific
Published: JOURNAL OF GRAPH THEORY 0364-9024 1097-0118 , 12 p. 2025
  • SJR Scopus - Discrete Mathematics and Combinatorics: D1
Identifiers
Subjects:
  • Mathematics
Citing (1)
Citation styles: IEEEACMAPAChicagoHarvardCSLCopyPrint
2026-07-17 19:30