The strong nine dragon tree conjecture is true for \(d \le k + 1\)
From MaRDI portal
Publication:6143938
DOI10.1007/S00493-023-00058-ZOpenAlexW4386028411WikidataQ123238552 ScholiaQ123238552MaRDI QIDQ6143938
Sebastion Mies, Benjamin Moore
Publication date: 25 January 2024
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-023-00058-z
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: The strong nine dragon tree conjecture is true for \(d \le k + 1\)