Question

Minimum Matching Decomposition | proof verification

score 176 · Answer 1 · 2026-03-25 01:13:11

176

Views

Minimum Matching Decomposition | proof verification

Published on 25 Mar 2026 - 1:13

score 298 · Answer 2 · 2026-03-20 02:26:11

298

Views

Extremal graph without cycle length $k$ or longer.

Published on 20 Mar 2026 - 2:26

score 325 · Answer 3 · 2026-03-25 06:11:13

325

Views

is there a graph with over 5 vertex that is bipartite and self complement

Published on 25 Mar 2026 - 6:11

score 615 · Answer 4 · 2026-03-25 19:03:13

615

Views

How to proof if these graphs are isomorphic or no?

Published on 25 Mar 2026 - 19:03

score 92 · Answer 5 · 2018-04-14 20:31:43

92

Views

Is $M(x, y) = 0$ when $x=y$; 1 otherwise a metric?

Published on 14 Apr 2018 - 20:31

score 516 · Answer 6 · 2026-03-22 21:56:11

516

Views

Finding vertex-cut using Menger's theorem

Published on 22 Mar 2026 - 21:56

score 63 · Answer 7 · 2026-03-25 17:21:53

63

Views

Strange distribution of triangle shapes connecting the leaves of a perfect $k$-ary tree

Published on 25 Mar 2026 - 17:21

score 32 · Answer 8 · 2018-04-15 06:23:31

Let $G=(V,E)$ be a directed weighted graph with $w:E \to \mathbb{R}$ and let $v \in V$. How can I find all negative/positive cycles containing $v$?

score 80 · Answer 9 · 2018-04-15 13:20:04

80

Views

Let $ \ G \ $ be a connected plane graph with $ \ v \ $ vertices and $ \ e \ $ edges

Published on 15 Apr 2018 - 13:20

score 253 · Answer 10 · 2018-04-15 14:23:17

253

Views

Surjective homomorphisms in graph theory.

Published on 15 Apr 2018 - 14:23

score 1.9k · Answer 11 · 2026-03-22 07:44:41

1.9k

Views

How to find Eulerian path in the given graph?

Published on 22 Mar 2026 - 7:44

score 447 · Answer 12 · 2018-04-15 17:03:56

447

Views

Rigorous proof of Frucht's theorem

Published on 15 Apr 2018 - 17:03

score 79 · Answer 13 · 2018-04-15 17:12:55

79

Views

Through what matrix formula can I get the number of paths of length in a weighted graph?

Published on 15 Apr 2018 - 17:12

score 2k · Answer 14 · 2026-03-25 17:16:49

2k

Views

Stack Size for Depth-First Search

Published on 25 Mar 2026 - 17:16

score 2.7k · Answer 15 · 2018-04-16 15:07:20

2.7k

Views

Prove that the chromatic number of a graph is the same as the maximum of the chromatic numbers its blocks.

Published on 16 Apr 2018 - 15:07

List Question

Minimum Matching Decomposition | proof verification

Extremal graph without cycle length $k$ or longer.

is there a graph with over 5 vertex that is bipartite and self complement

How to proof if these graphs are isomorphic or no?

Is $M(x, y) = 0$ when $x=y$; 1 otherwise a metric?

Finding vertex-cut using Menger's theorem

Strange distribution of triangle shapes connecting the leaves of a perfect $k$-ary tree

Let $G=(V,E)$ be a directed weighted graph with $w:E \to \mathbb{R}$ and let $v \in V$. How can I find all negative/positive cycles containing $v$?

Let $ \ G \ $ be a connected plane graph with $ \ v \ $ vertices and $ \ e \ $ edges

Surjective homomorphisms in graph theory.

How to find Eulerian path in the given graph?

Rigorous proof of Frucht's theorem

Through what matrix formula can I get the number of paths of length in a weighted graph?

Stack Size for Depth-First Search

Prove that the chromatic number of a graph is the same as the maximum of the chromatic numbers its blocks.

Trending Questions

Popular # Hahtags

Popular Questions