Prove that a graph that has a Hamilton circuit
121130
Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
65639
Existence of a self-complementary graph
82295
Showing that the minimal polynomial of an $n \times n$ matrix has degree at most $n$ without using the Cayley-Hamilton Theorem
49703
Analogue of closed graph theorem
119304
Latin Square and Graph Theory
119808
Proving that $n$-cycle has order $n$
4112
How to prove that a simple graph having 11 or more vertices or its complement is not planar?
42367
Prove that simple graph $G$ is orientable
35458
Prove, that graph $G$ has at least $\chi(G)(\chi(G)-1)/2$ edges.
97630
A graph which is not a single block has at least two leaf blocks
140199
Proof that disjoint cycles commute
86271
Spanning Trees: Prove if $e_1$ is an edge in $X$ that isn't in $Y$, then there exists an edge ...
49465
How many Hamiltonian cycles are there in a complete graph $K_n$ ($n\geq 3$) Why?
9847
Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.
108508
Prove that every tournament contains at least one Hamiltonian path.
49585
Proof a graph is bipartite if and only if it contains no odd cycles
75101
Let G = (V, E) be a simple undirected graph with n = |V | ≥ 1 vertices...