How can I partition a graph with 2n odd vertices into n open trails?
48184
Prove a graph Containing $2k$ odd vertices contains $k$ distinct trails
104010
The number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts
6432
How many ways can N elements be partitioned into subsets of size K?
86067
A Variation of the even-town odd-town problem
22274
Partitioning a natural number $n$ in order to get the maximum product sequence of its addends
79631
Find a graph on eight vertices with a pair of pseudosimilar vertices
142917
Graph vertex chromatic number in a union of 2 sub-graphs
120684
Calculating the number of possible paths through some squares
27407
every planar graph can be expressed as a union of five edge-disjoint forests
14185
Graph Algorithm To Find All Connections Between Two Arbitrary Vertices
43845
Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
39753
Proving that in a simple graph with $n$ vertices, two vertices have the same degree
8469
Dividing an equilateral triangle into N equal (possibly non-connected) parts
134242
Graph partition that span a third of edges
54749
How to find the number of perfect matchings in complete graphs?
119543
Counting edges in a specially defined graph
52089
Group of $2n$ elements, $n$ odd, is not simple