Graph contains a cycle containing at least 4 nodes
9847
Prove that if every node in a simple graph $G$ has degree $3$ or higher, then $G$ contains a cycle with a chord.
128034
Problem on Extremal Graphs: three independent paths
28877
Graph with $k$ components.
116516
If the diameter of graph is greater than 3 then the diameter of its complement graph is less than 3
58081
Hamiltonian cycles in associahedron graphs
127965
Graph theory (Graph Connectivity)
85510
Algorithm to check whether a graph has no cycles
115085
number of vertices in a self-complemntary graph
145718
Proving that A connected graph on $n$ vertices is a tree iff it has $n-1$ edges
75101
Let G = (V, E) be a simple undirected graph with n = |V | ≥ 1 vertices...
99746
Vertex cover in a graph with maximum degree of 3 and average degree of 2.
79631
Find a graph on eight vertices with a pair of pseudosimilar vertices
90559
Partitioning of a graph
113015
Eulerian Paths in a Complete Graph $K_5$
18117
Maximum number of edges in a simple graph?
57471
Directing graph such that any outdegree would be at most 2
133488
Layered graph with variable number of nodes on each layer