Question

Find maximum number of nodes in a regular graph of degree 4 and diameter 2

score 618 · Answer 1 · 2026-04-17 04:42:04

618

Views

Find maximum number of nodes in a regular graph of degree 4 and diameter 2

Published on 17 Apr 2026 - 4:42

score 413 · Answer 2 · 2026-04-16 08:21:19

413

Views

$3$-connected non-hamiltonian graph with at most $3$ independent vertices

Published on 16 Apr 2026 - 8:21

score 297 · Answer 3 · 2026-04-14 06:21:16

297

Views

A simple problem of graph theory about the degree of vertices.

Published on 14 Apr 2026 - 6:21

score 163 · Answer 4 · 2026-04-16 01:41:00

163

Views

Graph theory problems about vertices and interior angles.

Published on 16 Apr 2026 - 1:41

score 670 · Answer 5 · 2026-04-15 07:06:03

670

Views

Does $\beta(G)=\alpha'(G)$ always?

Published on 15 Apr 2026 - 7:06

score 1.6k · Answer 6 · 2026-04-14 22:07:41

1.6k

Views

Proving two graphs are isomorphic in polynomial time - Bondy/Murty - Graph Theory Page 6

Published on 14 Apr 2026 - 22:07

score 78 · Answer 7 · 2026-04-16 01:51:25

78

Views

How can I prove that a graph with a required amount of edges per node is invalid?

Published on 16 Apr 2026 - 1:51

score 1.1k · Answer 8 · 2026-04-11 19:14:02

1.1k

Views

Prove that there always exists a fair driving schedule

Published on 11 Apr 2026 - 19:14

score 136 · Answer 9 · 2026-04-15 11:07:52

136

Views

Examples of sequences of graphs with different order of Cheeger constant and spectral gap

Published on 15 Apr 2026 - 11:07

score 49 · Answer 10 · 2026-04-16 01:05:38

49

Views

possible embeddings for a $2$-connected planar graph

Published on 16 Apr 2026 - 1:05

score 38 · Answer 11 · 2026-04-13 15:20:28

38

Views

Help with proof of the existance of a graph produced from deleting edges

Published on 13 Apr 2026 - 15:20

score 322 · Answer 12 · 2026-04-11 11:34:52

322

Views

How to Apply Hall's theorem in this question?

Published on 11 Apr 2026 - 11:34

score 288 · Answer 13 · 2026-04-14 19:55:56

288

Views

How many 1-regular graphs can be produced by deleting edges from a even complete graph?

Published on 14 Apr 2026 - 19:55

score 2.6k · Answer 14 · 2026-04-14 12:01:59

2.6k

Views

Prove that if $G$ and $H$ is Hamiltonian then $G \times H$ is Hamiltonian

Published on 14 Apr 2026 - 12:01

score 197 · Answer 15 · 2026-04-14 18:01:34

197

Views

Show that $G$ is $2$-connected but not necessarily Hamiltonian

Published on 14 Apr 2026 - 18:01

List Question

Find maximum number of nodes in a regular graph of degree 4 and diameter 2

$3$-connected non-hamiltonian graph with at most $3$ independent vertices

A simple problem of graph theory about the degree of vertices.

Graph theory problems about vertices and interior angles.

Does $\beta(G)=\alpha'(G)$ always?

Proving two graphs are isomorphic in polynomial time - Bondy/Murty - Graph Theory Page 6

How can I prove that a graph with a required amount of edges per node is invalid?

Prove that there always exists a fair driving schedule

Examples of sequences of graphs with different order of Cheeger constant and spectral gap

possible embeddings for a $2$-connected planar graph

Help with proof of the existance of a graph produced from deleting edges

How to Apply Hall's theorem in this question?

How many 1-regular graphs can be produced by deleting edges from a even complete graph?

Prove that if $G$ and $H$ is Hamiltonian then $G \times H$ is Hamiltonian

Show that $G$ is $2$-connected but not necessarily Hamiltonian

Trending Questions

Popular # Hahtags

Popular Questions