Show that if $G$ is connected and it has two spanning trees with differente edges, then $G$ has a spanning graph eulerian
50886
Two disjoint spanning trees, spanning subgraph with all even degrees
113902
Show that there's a unique minimum spanning tree if all edges have different costs
82578
Show that if $G$ is $2-$connected, then for any two vertices $u$ and $v$ there exists a cycle $C$ such that $u, v \in V (C)$
147275
Finding a Eulerian Tour
98991
How many different spanning trees of $K_n \setminus e$ are there?
121130
Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
127818
How do I prove that a graph is a topological manifold
102084
How to show path-connectedness of $GL(n,\mathbb{C})$
51349
Minimal cut edges number in connected Eulerian graph.
127277
Graph Theory: Tree has at least 2 vertices of degree 1
106801
Labelled spanning trees of $K_n-e$
12104
How to prove this result involving the quotient maps and connectedness?
68638
Show that if $n\geq 3$, the complete graph on $n$ vertices $K_n$ contains a Hamiltonian cycle.
49703
Analogue of closed graph theorem
113015
Eulerian Paths in a Complete Graph $K_5$
99781
Proof that any simple connected graph has at least 2 non-cut vertices.
6429
prove that a connected graph with $n$ vertices has at least $n-1$ edges