ON NUMBER OF WAYS TO SHELL THE k-DIMENSIONAL TREES

DOI10.4134/BKMS.2007.44.2.259zbMath1149.05013OpenAlexW1965498535MaRDI QIDQ5437826

Gab-Byung Chae, Sang-Mok Kim, Minseok Cheong

Publication date: 28 January 2008

Published in: Bulletin of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4134/bkms.2007.44.2.259

zbMATH Keywords

shellable complex\(k\)-treepure complexrecursive \(k\)-tree

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Hypergraphs (05C65) Enumeration in graph theory (05C30)

This page was built for publication: ON NUMBER OF WAYS TO SHELL THE k-DIMENSIONAL TREES