Question

In graph $G$, for each vertex v with even and positive degree, There is a non-trivial cycle $(\ge 3)$ from $v$ to $v$.

score 61 · Answer 1 · 2018-01-17 08:17:27

In graph $G$, for each vertex v with even and positive degree, There is a non-trivial cycle $(\ge 3)$ from $v$ to $v$.

score 123 · Answer 2 · 2026-03-23 00:33:08

123

Views

Perfect Matching

Published on 23 Mar 2026 - 0:33

score 930 · Answer 3 · 2026-03-22 13:20:44

930

Views

All stable matchings of a given bipartite graph cover the same vertices.

Published on 22 Mar 2026 - 13:20

score 94 · Answer 4 · 2026-03-24 22:08:18

94

Views

Prove that G is perfect

Published on 24 Mar 2026 - 22:08

score 706 · Answer 5 · 2026-03-24 12:52:52

706

Views

constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?

Published on 24 Mar 2026 - 12:52

score 137 · Answer 6 · 2026-03-22 09:59:45

137

Views

Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree

Published on 22 Mar 2026 - 9:59

score 75 · Answer 7 · 2026-03-17 15:27:05

75

Views

Lovász Theta for self-complementary graphs

Published on 17 Mar 2026 - 15:27

score 65 · Answer 8 · 2026-03-17 07:20:38

65

Views

Generating cycles on a strongly connected graph

Published on 17 Mar 2026 - 7:20

score 2.4k · Answer 9 · 2018-01-17 23:01:08

2.4k

Views

Find all non-isomorphic complete bipartite graphs with at most 7 vertices?

Published on 17 Jan 2018 - 23:01

score 319 · Answer 10 · 2026-03-19 09:25:33

319

Views

Isomorphism, two graphs

Published on 19 Mar 2026 - 9:25

score 911 · Answer 11 · 2026-03-22 10:10:43

911

Views

Maximum matching saturating a vertex

Published on 22 Mar 2026 - 10:10

score 58 · Answer 12 · 2026-03-20 12:34:37

58

Views

Prove that the subgraph is a complete directed graph

Published on 20 Mar 2026 - 12:34

score 1.8k · Answer 13 · 2026-03-19 20:06:46

1.8k

Views

Show that both graphs drawn below are isomorphic by giving an isomorphism for them. (Petersen Graph)

Published on 19 Mar 2026 - 20:06

score 893 · Answer 14 · 2026-03-17 10:59:38

893

Views

Prove that simple graph $G$ is orientable

Published on 17 Mar 2026 - 10:59

score 66 · Answer 15 · 2026-03-22 16:41:55

66

Views

Most efficient way to detect if a series of n edges creates a cycle of size n.

Published on 22 Mar 2026 - 16:41

List Question

In graph $G$, for each vertex v with even and positive degree, There is a non-trivial cycle $(\ge 3)$ from $v$ to $v$.

Perfect Matching

All stable matchings of a given bipartite graph cover the same vertices.

Prove that G is perfect

constraints to the hamiltonian path: can one tell if a path is hamiltonian by looking at it?

Graph with a vertex of infinite degree elementary equiv. with a graph with vertices of arbitrarily large finite degree

Lovász Theta for self-complementary graphs

Generating cycles on a strongly connected graph

Find all non-isomorphic complete bipartite graphs with at most 7 vertices?

Isomorphism, two graphs

Maximum matching saturating a vertex

Prove that the subgraph is a complete directed graph

Show that both graphs drawn below are isomorphic by giving an isomorphism for them. (Petersen Graph)

Prove that simple graph $G$ is orientable

Most efficient way to detect if a series of n edges creates a cycle of size n.

Trending Questions

Popular # Hahtags

Popular Questions