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 66 · Answer 1 · 2026-05-03 13:35:16

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 132 · Answer 2 · 2026-04-30 00:18:25

132

Views

Perfect Matching

Published on 30 Apr 2026 - 0:18

score 939 · Answer 3 · 2026-05-05 06:18:57

939

Views

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

Published on 05 May 2026 - 6:18

score 99 · Answer 4 · 2026-05-03 13:33:47

99

Views

Prove that G is perfect

Published on 03 May 2026 - 13:33

score 713 · Answer 5 · 2026-05-05 04:13:10

713

Views

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

Published on 05 May 2026 - 4:13

score 149 · Answer 6 · 2026-05-07 12:41:25

149

Views

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

Published on 07 May 2026 - 12:41

score 79 · Answer 7 · 2026-05-03 13:35:05

79

Views

Lovász Theta for self-complementary graphs

Published on 03 May 2026 - 13:35

score 73 · Answer 8 · 2026-05-04 20:16:58

73

Views

Generating cycles on a strongly connected graph

Published on 04 May 2026 - 20:16

score 2.4k · Answer 9 · 2026-05-03 13:33:31

2.4k

Views

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

Published on 03 May 2026 - 13:33

score 327 · Answer 10 · 2026-05-05 16:06:25

327

Views

Isomorphism, two graphs

Published on 05 May 2026 - 16:06

score 917 · Answer 11 · 2026-04-29 12:27:29

917

Views

Maximum matching saturating a vertex

Published on 29 Apr 2026 - 12:27

score 64 · Answer 12 · 2026-04-29 12:30:51

64

Views

Prove that the subgraph is a complete directed graph

Published on 29 Apr 2026 - 12:30

score 1.8k · Answer 13 · 2026-05-04 08:30:29

1.8k

Views

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

Published on 04 May 2026 - 8:30

score 897 · Answer 14 · 2026-05-03 13:33:31

897

Views

Prove that simple graph $G$ is orientable

Published on 03 May 2026 - 13:33

score 73 · Answer 15 · 2026-04-29 12:56:07

73

Views

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

Published on 29 Apr 2026 - 12:56

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