The following pages link to (Q4595189):
Displaying 12 items.
- Counting connected set partitions of graphs (Q625376) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- Enumerating consecutive and nested partitions for graphs (Q1378295) (← links)
- Estimation of the number of connected sets in a graph and the structure of components of random subsets (Q1594350) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Compositions of complements of graphs (Q2830375) (← links)
- (Q5494773) (← links)
- The average size of a connected vertex set of a graph—Explicit formulas and open problems (Q6055930) (← links)
- The number and average size of connected sets in graphs with degree constraints (Q6081554) (← links)
- Extremal problems for connected set enumeration (Q6094711) (← links)
- The number of ways to construct a connected graph: a graph-based generalization of the binomial coefficients (Q6135999) (← links)
- Computing the number and average size of connected sets in planar 3-trees (Q6540641) (← links)
