Total number of spanning trees of K7 if one edge is deleted
106801
Labelled spanning trees of $K_n-e$
157939
prove that a graph is one-ended
17086
The number of (non-equal) forests on the vertex set V = {1, 2, ...,n} that contains exactly 2 connected components is given by
90559
Partitioning of a graph
43845
Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
18881
Number of elements of order $7$ in a group
151152
Removing nodes from graphs such that one is dependent on other - ZIO $2010$, P$1$
48184
Prove a graph Containing $2k$ odd vertices contains $k$ distinct trails
99806
Given an undirected Graph
88628
Proving the total number of subsets of S is equal to $2^n$
137322
Construction of a triangle-free graph of chromatic number $1526$
117862
Number of partitions of an $n$-element set into $k$ classes
133573
characteristic polynomial of the adjacency matrix of a tree
102539
Min. number of vertices in graph as function of $\kappa(G)$ and $\operatorname{diam}(G)$
55944
Chromatic polynomial of connected graph $ \leq x(x-1)^{n-1}$
145181
How can I prove the maximum number of edges?
71154
Why a complete graph has $\frac{n(n-1)}{2}$ edges?