Enumeration of labelled (k,m)-trees

DOI10.1006/JCTA.1998.2916zbMATH Open0918.05067OpenAlexW1981835238MaRDI QIDQ1284483FDOQ1284483

Authors: Oleg Pikhurko 

Publication date: 19 August 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1998.2916

Recommendations

• Enumeration of \(K\)-trees and applications
• How to count \(k\)-paths
• scientific article; zbMATH DE number 4103086
• On the number of spanning trees of \(K_ n\) and \(K_{m,n}\)
• \(\Gamma \)-species and the enumeration of \(k\)-trees

zbMATH Keywords

tree

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Cites Work

• Enumerating k-trees
• The number of labeled k-dimensional trees
• The number of labeled k-trees
• Title not available (Why is that?)
• Cayley's formula for multidimensional trees
• Title not available (Why is that?)
• Higher-dimensional tree structures. I
• A coding algorithm for Rényi trees
• Title not available (Why is that?)

Cited In (13)

• Enumeration of \(m\)-ary cacti
• \(\alpha\)-labeling number of trees
• The number of \(m\)-Husimi trees fixed by a permutation of the vertices
• How to count \(k\)-paths
• Title not available (Why is that?)
• Labelled and unlabelled enumeration of \(k\)-gonal 2-trees
• Finitely labeled generating trees and restricted permutations
• On the number of labeled \(k\)-arch graphs
• Counting special families of labelled trees
• Enumeration of \(K\)-trees and applications
• Counting unlabeled \(k\)-trees
• Labelled trees and factorizations of a cycle into transpositions
• A generalized enumeration of labeled trees and reverse Prüfer algorithm

This page was built for publication: Enumeration of labelled \((k,m)\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284483)