How to Prove that a 3-regular bridgeless graph has perfect matching?
58587
3-regular graphs with no bridges
121130
Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
131736
Proving a triangle with different edge colors exists in a graph.
108417
Cycles of length k in a complete simple graph with n vertices
126060
Proving that a Euler Circuit has a even degree for every vertex
140114
Using Halls Theorem to show Graph contains a perfect matching containing any edge.
71154
Why a complete graph has $\frac{n(n-1)}{2}$ edges?
72267
Prove there's a simple path of length $k$ in a simple graph $G$ where all the vertices have degree of at least $k$
31626
proving that a graph is hamiltonian (Ore's theorem)
116538
Proof of Connected Diagrams
17086
The number of (non-equal) forests on the vertex set V = {1, 2, ...,n} that contains exactly 2 connected components is given by
38466
Proving that the number of vertices of odd degree in any graph G is even
142861
Multipartite graphs which are not planar
78243
graph-theory problem about outdegree and indegree
142917
Graph vertex chromatic number in a union of 2 sub-graphs
133270
Prove that the chromatic polynomial of a cycle graph $C_{n}$ equals $(k-1)^{n} + (k-1)(-1)^{n}$
39753
Proving that in a simple graph with $n$ vertices, two vertices have the same degree