Question

When can a weighted graph be embedded in a metric space?

score 836 · Answer 1 · 2026-04-05 22:34:20

836

Views

When can a weighted graph be embedded in a metric space?

Published on 05 Apr 2026 - 22:34

score 168 · Answer 2 · 2019-01-05 02:02:33

168

Views

Is right this chromatic polynomial for this Bridge Graph?

Published on 05 Jan 2019 - 2:02

score 524 · Answer 3 · 2026-03-25 09:53:34

524

Views

Finding $K_{3,3}$-subdivision when adding edge to maximal planar graph.

Published on 25 Mar 2026 - 9:53

score 113 · Answer 4 · 2026-03-25 12:25:33

113

Views

A problem in proving isomorphism classes of cores forming a lattice

Published on 25 Mar 2026 - 12:25

score 68 · Answer 5 · 2019-01-05 04:52:08

68

Views

Prove algorithm to find a tour in an even degree graph by induction.

Published on 05 Jan 2019 - 4:52

score 137 · Answer 6 · 2026-03-25 06:17:02

137

Views

Flow Decomposition theorem explanation

Published on 25 Mar 2026 - 6:17

score 470 · Answer 7 · 2026-03-31 06:16:09

470

Views

How to get the shortest path from $s$ to $t$ in a graph $G_1(V,E_1)$ after using Dijkstra's algorithm?

Published on 31 Mar 2026 - 6:16

score 113 · Answer 8 · 2026-03-25 23:35:41

113

Views

Isoperimetric constant on random graph

Published on 25 Mar 2026 - 23:35

score 158 · Answer 9 · 2026-03-25 13:53:37

158

Views

A simple game with $n$ points in 3D space - red triangle wins

Published on 25 Mar 2026 - 13:53

score 670 · Answer 10 · 2026-03-25 22:04:29

670

Views

$n$ vertex graph with more edges than its Turan number: $e(G) = t_r(n) + 1$

Published on 25 Mar 2026 - 22:04

score 175 · Answer 11 · 2019-01-06 07:13:55

175

Views

Minimum number of colors enough to color the vertices of any graph whose vertex lies on at most $k$-odd cycles.

Published on 06 Jan 2019 - 7:13

score 268 · Answer 12 · 2026-03-25 16:06:13

268

Views

Monochromatic triangle - graph coloring

Published on 25 Mar 2026 - 16:06

score 26 · Answer 13 · 2019-01-06 19:21:31

26

Views

Large graph connectivity implies both many and few edges?

Published on 06 Jan 2019 - 19:21

score 107 · Answer 14 · 2026-03-30 07:07:58

107

Views

A graph-coloring problem where only some of the edges should be bichromatic

Published on 30 Mar 2026 - 7:07

score 1.2k · Answer 15 · 2019-01-06 22:52:18

1.2k

Views

Undirected graph G with no cycles

Published on 06 Jan 2019 - 22:52

List Question

When can a weighted graph be embedded in a metric space?

Is right this chromatic polynomial for this Bridge Graph?

Finding $K_{3,3}$-subdivision when adding edge to maximal planar graph.

A problem in proving isomorphism classes of cores forming a lattice

Prove algorithm to find a tour in an even degree graph by induction.

Flow Decomposition theorem explanation

How to get the shortest path from $s$ to $t$ in a graph $G_1(V,E_1)$ after using Dijkstra's algorithm?

Isoperimetric constant on random graph

A simple game with $n$ points in 3D space - red triangle wins

$n$ vertex graph with more edges than its Turan number: $e(G) = t_r(n) + 1$

Minimum number of colors enough to color the vertices of any graph whose vertex lies on at most $k$-odd cycles.

Monochromatic triangle - graph coloring

Large graph connectivity implies both many and few edges?

A graph-coloring problem where only some of the edges should be bichromatic

Undirected graph G with no cycles

Trending Questions

Popular # Hahtags

Popular Questions