List questions from graph-theory

Published on 25 Mar 2026 - 22:09

71

Views

Lower bound of chromatic number of some graph

Published on 07 Dec 2018 - 11:24

47

Views

How to find the location of negative cost dicircuit with Bellman-Ford algorithm?

Published on 30 Mar 2026 - 16:03

48

Views

Defining the connectivity of a graph

Published on 01 Apr 2026 - 7:20

73

Views

Specialization of Erdos Gallai Theorem To Vertex Exclusions

Published on 08 Dec 2018 - 1:20

41

Views

How to create sets of nodes on a colored graph while cutting as few edges as possible

Published on 26 Mar 2026 - 6:30

69

Views

the implications of the four colour theorem

Published on 08 Dec 2018 - 8:38

357

Views

How would I reduce the Minimum Vertex Cover problem to a Weighted MAX SAT problem?

Published on 25 Mar 2026 - 11:22

523

Views

Delete k vertices from a graph such that it remains connected

Published on 08 Dec 2018 - 11:26

290

Views

Suppose a graph $G$ is connected with $n$ vertices and $e$ edges. If $n \geq 3$ and $G$ has exactly one cycle, prove that $e=n$.

Published on 08 Dec 2018 - 12:31

1.3k

Views

Definitions of $\epsilon$-regular partition

Published on 29 Mar 2026 - 5:11

283

Views

Coloring binary tree edges with given number of colors

Published on 26 Mar 2026 - 5:54

62

Views

Vertex and graph

Published on 08 Dec 2018 - 20:40

1.6k

Views

Proving that we can construct an Euler trail in an undirected graph G, iff G is connected and has exactly two vertices of odd degree.

Published on 08 Dec 2018 - 22:56

360

Views

Infinite "connected" graphs and spanning trees

Published on 26 Mar 2026 - 5:56

List Question

Probability of being in same connected component

Lower bound of chromatic number of some graph

How to find the location of negative cost dicircuit with Bellman-Ford algorithm?

Defining the connectivity of a graph

Specialization of Erdos Gallai Theorem To Vertex Exclusions

How to create sets of nodes on a colored graph while cutting as few edges as possible

the implications of the four colour theorem

How would I reduce the Minimum Vertex Cover problem to a Weighted MAX SAT problem?

Delete k vertices from a graph such that it remains connected

Suppose a graph $G$ is connected with $n$ vertices and $e$ edges. If $n \geq 3$ and $G$ has exactly one cycle, prove that $e=n$.

Definitions of $\epsilon$-regular partition

Coloring binary tree edges with given number of colors

Vertex and graph

Proving that we can construct an Euler trail in an undirected graph G, iff G is connected and has exactly two vertices of odd degree.

Infinite "connected" graphs and spanning trees

Trending Questions

Popular # Hahtags

Popular Questions