Perfect matchings and \(k\)-decomposability of increasing trees
From MaRDI portal
Publication:2654607
zbMath1187.05059MaRDI QIDQ2654607
Markus Kuba, Stephan G. Wagner
Publication date: 19 January 2010
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/227529
Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Perfect matchings and \(k\)-decomposability of increasing trees