List questions from graph-theory

Published on 26 Jan 2018 - 15:22

1.5k

Views

Graph Theory: A loop-free connected graph with degree sequence

Published on 26 Jan 2018 - 15:48

163

Views

Tournament puzzle

Published on 25 Mar 2026 - 11:34

494

Views

4-chromatic unit distance graph with no 4-cycles.

Published on 20 Mar 2026 - 7:10

244

Views

Upper Bound on Vertices in SCC Graph of Directed Random Graph

Published on 23 Mar 2026 - 5:54

1.6k

Views

Graph Theory: Connected graph and vertex degrees

Published on 27 Jan 2018 - 3:48

51

Views

are the following isomorphic?

Published on 27 Jan 2018 - 5:38

208

Views

If a set of vertex $X$ is maximal independent, then $X$ is a minimal dominating set

Published on 27 Jan 2018 - 8:48

211

Views

Dijkstra's algorithm - paradox

Published on 25 Mar 2026 - 9:22

192

Views

Probability that in fully connected graph there is a clique of different colors

Published on 20 Mar 2026 - 1:29

2.8k

Views

Prove that if a graph $G$ has a Hamilton path then for every $S \subseteq V(G)$ the number of components of $G - S$ is at most $|S| + 1$

Published on 22 Mar 2026 - 13:24

1.1k

Views

Using Ore's theorem to show the graph contains a Hamilton cycle

Published on 22 Mar 2026 - 19:36

52

Views

Trying to compute a limit for the Turán number

Published on 17 Mar 2026 - 11:51

864

Views

A party contradicting Handshaking Lemma

Published on 27 Jan 2018 - 22:40

2k

Views

self-complementary graph: Number of Edges

Published on 27 Jan 2018 - 23:16

List Question

Number of edges in the simple graph with the given conditions

Graph Theory: A loop-free connected graph with degree sequence

Tournament puzzle

4-chromatic unit distance graph with no 4-cycles.

Upper Bound on Vertices in SCC Graph of Directed Random Graph

Graph Theory: Connected graph and vertex degrees

are the following isomorphic?

If a set of vertex $X$ is maximal independent, then $X$ is a minimal dominating set

Dijkstra's algorithm - paradox

Probability that in fully connected graph there is a clique of different colors

Prove that if a graph $G$ has a Hamilton path then for every $S \subseteq V(G)$ the number of components of $G - S$ is at most $|S| + 1$

Using Ore's theorem to show the graph contains a Hamilton cycle

Trying to compute a limit for the Turán number

A party contradicting Handshaking Lemma

self-complementary graph: Number of Edges

Trending Questions

Popular # Hahtags

Popular Questions