Question

Graph theory Problem 'of the court'

score 93 · Answer 1 · 2019-03-22 23:02:31

93

Views

Graph theory Problem 'of the court'

Published on 22 Mar 2019 - 23:02

score 297 · Answer 2 · 2026-03-25 12:13:42

297

Views

Shortest Path Problem and/ Dummy nodes?

Published on 25 Mar 2026 - 12:13

score 144 · Answer 3 · 2019-03-23 10:39:08

144

Views

Minimal set of edges.

Published on 23 Mar 2019 - 10:39

score 34 · Answer 4 · 2026-03-25 13:53:11

34

Views

Finding number of two cycle multi-graphs

Published on 25 Mar 2026 - 13:53

score 184 · Answer 5 · 2026-03-25 09:35:45

184

Views

Graph valued function, mapping from reals to graph (maybe about realization of functors)?

Published on 25 Mar 2026 - 9:35

score 345 · Answer 6 · 2019-03-23 15:51:56

Prove that the graph on the respective unions of the vertex and edge sets of two connected graphs with exactly one common vertex is also connected

score 691 · Answer 7 · 2019-03-23 19:00:43

691

Views

Showing that $G$ contains a path such that it remains connected after removing the path.

Published on 23 Mar 2019 - 19:00

score 110 · Answer 8 · 2019-03-23 20:24:32

110

Views

Prove or disprove: for all graphs $G = (V, E)$, if $|E| = |V| - 1$ then $G$ is a tree.

Published on 23 Mar 2019 - 20:24

score 53 · Answer 9 · 2019-03-23 20:49:10

53

Views

If a graph $G = (V, E)$ has $|E| \geq |V| − 1$, is it connected?

Published on 23 Mar 2019 - 20:49

score 26 · Answer 10 · 2026-04-03 23:02:10

26

Views

Examples of realization of functors between quite diverse categories?

Published on 03 Apr 2026 - 23:02

score 295 · Answer 11 · 2019-03-24 01:17:53

295

Views

Can a path colored by a greedy algorithm ever have more than 2 colors?

Published on 24 Mar 2019 - 1:17

score 37 · Answer 12 · 2019-03-24 03:10:21

37

Views

domination in directed graphs with transitive tournaments

Published on 24 Mar 2019 - 3:10

score 156 · Answer 13 · 2019-03-24 04:29:17

156

Views

help finding the chromatic number for a graph with two blocks as subgraphs that share a single vertex

Published on 24 Mar 2019 - 4:29

score 529 · Answer 14 · 2019-03-24 10:34:09

529

Views

A graph which is not a single block has at least two leaf blocks

Published on 24 Mar 2019 - 10:34

score 479 · Answer 15 · 2019-03-24 15:26:04

479

Views

$k$-regular and not complete graph and distance

Published on 24 Mar 2019 - 15:26

List Question

Graph theory Problem 'of the court'

Shortest Path Problem and/ Dummy nodes?

Minimal set of edges.

Finding number of two cycle multi-graphs

Graph valued function, mapping from reals to graph (maybe about realization of functors)?

Prove that the graph on the respective unions of the vertex and edge sets of two connected graphs with exactly one common vertex is also connected

Showing that $G$ contains a path such that it remains connected after removing the path.

Prove or disprove: for all graphs $G = (V, E)$, if $|E| = |V| - 1$ then $G$ is a tree.

If a graph $G = (V, E)$ has $|E| \geq |V| − 1$, is it connected?

Examples of realization of functors between quite diverse categories?

Can a path colored by a greedy algorithm ever have more than 2 colors?

domination in directed graphs with transitive tournaments

help finding the chromatic number for a graph with two blocks as subgraphs that share a single vertex

A graph which is not a single block has at least two leaf blocks

$k$-regular and not complete graph and distance

Trending Questions

Popular # Hahtags

Popular Questions