Question

How to find a minimal planar covering of a graph

score 55 · Answer 1 · 2026-03-20 02:01:02

55

Views

How to find a minimal planar covering of a graph

Published on 20 Mar 2026 - 2:01

score 48 · Answer 2 · 2026-03-25 07:39:00

48

Views

Deterministic Online Graph Coloring

Published on 25 Mar 2026 - 7:39

score 491 · Answer 3 · 2026-03-22 17:13:15

491

Views

Is it true that every graph with $n$ vertices in which $\delta(G)\geq\frac{n}{2}-1$ has Hamiltionian path?

Published on 22 Mar 2026 - 17:13

score 477 · Answer 4 · 2026-03-19 23:11:10

477

Views

Complete graphs in the plane with colored edges where an edge don't cross edges with same color

Published on 19 Mar 2026 - 23:11

score 173 · Answer 5 · 2018-01-24 15:18:18

Prove that in a connected graph G if $|G| < 2\delta(G)$ then the longest path in the graph consists of all vertices of the graph.

score 25 · Answer 6 · 2018-01-25 01:23:29

25

Views

Can a graph have more then one undirected path between two nodes?

Published on 25 Jan 2018 - 1:23

score 222 · Answer 7 · 2026-03-17 08:53:03

222

Views

If the weight of edge E $e$ of an MST is decreased by $\delta$. Could total weight of MST decrease by more than $\delta$.

Published on 17 Mar 2026 - 8:53

score 22 · Answer 8 · 2018-01-25 04:48:37

22

Views

Graph Theory and Dijkstra's Algoirthm

Published on 25 Jan 2018 - 4:48

score 1.4k · Answer 9 · 2026-03-22 04:32:29

1.4k

Views

Alternative proof for the number of edges in a forest

Published on 22 Mar 2026 - 4:32

score 174 · Answer 10 · 2018-01-25 13:27:33

174

Views

Graph theory problem involving induction

Published on 25 Jan 2018 - 13:27

score 721 · Answer 11 · 2026-03-23 01:07:22

721

Views

# of vertices and # of connected components proof problem?

Published on 23 Mar 2026 - 1:07

score 889 · Answer 12 · 2026-03-23 01:28:52

889

Views

Diagonally dominant matrix by rows and/or by columns

Published on 23 Mar 2026 - 1:28

score 67 · Answer 13 · 2018-01-26 00:38:46

67

Views

Graph theory Orientable Graphs

Published on 26 Jan 2018 - 0:38

score 114 · Answer 14 · 2018-01-26 02:14:15

114

Views

Let G= (V; E) be a graph. Prove that G is a connected graph

Published on 26 Jan 2018 - 2:14

score 6.3k · Answer 15 · 2026-03-17 19:20:29

6.3k

Views

Proof in graph theory: maximum degree and number of leaves.

Published on 17 Mar 2026 - 19:20

List Question

How to find a minimal planar covering of a graph

Deterministic Online Graph Coloring

Is it true that every graph with $n$ vertices in which $\delta(G)\geq\frac{n}{2}-1$ has Hamiltionian path?

Complete graphs in the plane with colored edges where an edge don't cross edges with same color

Prove that in a connected graph G if $|G| < 2\delta(G)$ then the longest path in the graph consists of all vertices of the graph.

Can a graph have more then one undirected path between two nodes?

If the weight of edge E $e$ of an MST is decreased by $\delta$. Could total weight of MST decrease by more than $\delta$.

Graph Theory and Dijkstra's Algoirthm

Alternative proof for the number of edges in a forest

Graph theory problem involving induction

# of vertices and # of connected components proof problem?

Diagonally dominant matrix by rows and/or by columns

Graph theory Orientable Graphs

Let G= (V; E) be a graph. Prove that G is a connected graph

Proof in graph theory: maximum degree and number of leaves.

Trending Questions

Popular # Hahtags

Popular Questions