A graph that all its vertices are vertices cut
99781
Proof that any simple connected graph has at least 2 non-cut vertices.
91253
Proving that every graph that each vertex at degree 2 must contain a cycle
45510
Number of vertices present in all maximum matchings
71990
Prove there always exists a partition such that vertices in each part have even degree
500
Draw a graph with a common vertex
78511
Splitting disconnected vertices in different objects
19807
Connected graph with colored edges
28877
Graph with $k$ components.
127965
Graph theory (Graph Connectivity)
154500
Typing Complete Graphs with edge and vertex label
121130
Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
59203
isomorphic planar graph with its complement
99746
Vertex cover in a graph with maximum degree of 3 and average degree of 2.
99806
Given an undirected Graph
119543
Counting edges in a specially defined graph
91134
In any finite graph with at least two vertices, there must be two vertices with the same degree
146933
Proving bipartition in a connected planar graph