Subset counting in trees

zbMATH Open1224.05028MaRDI QIDQ3070348FDOQ3070348

Authors: Stephan Wagner 

Publication date: 2 February 2011

Recommendations

• On maximal independent sets of nodes in trees
• scientific article; zbMATH DE number 3957134
• On generalized independent subsets of trees
• scientific article; zbMATH DE number 3849252
• Twelve countings with rooted plane trees

zbMATH Keywords

treegenerating functionbinary treerooted treeindependent subsetsubset counting

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Cited In (11)

• Title not available (Why is that?)
• Counting labels in binary trees
• Efficient counting of square substrings in a tree
• On maximal independent sets of nodes in trees
• Title not available (Why is that?)
• Losing Treewidth by Separating Subsets
• THE EXFECTED INDEPENDENT DOMINATION NUMBER OF TWO TYPES OF TREES
• Computing the number and average size of connected sets in planar 3-trees
• On the average number of nodes covering a given number of leaves in an unordered binary tree
• Counting canonical partitions in the random graph
• Title not available (Why is that?)

This page was built for publication: Subset counting in trees

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