Decompositions into two linear forests of bounded lengths

DOI10.1016/j.disc.2024.113962arXiv2301.11615OpenAlexW4392934885MaRDI QIDQ6424564

Benjamin Moore, Florian Hoersch, Rutger Campbell

Publication date: 27 January 2023

Full work available at URL: https://doi.org/10.1016/j.disc.2024.113962

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Decompositions into two linear forests of bounded lengths