Question

Proof of Hamiltonian Cycle in a Complete Bipartite Graph

score 26.3k · Answer 1 · 2026-04-10 03:38:38

26.3k

Views

Proof of Hamiltonian Cycle in a Complete Bipartite Graph

Published on 10 Apr 2026 - 3:38

score 236 · Answer 2 · 2026-04-16 05:13:39

236

Views

Number of spanning trees in $K_9$ with the degree of vertex $1$ being $4$

Published on 16 Apr 2026 - 5:13

score 792 · Answer 3 · 2026-04-15 17:18:39

792

Views

Vertex-transitive graphs and deletion of vertices

Published on 15 Apr 2026 - 17:18

score 214 · Answer 4 · 2026-04-16 03:41:22

214

Views

Can anyone give an example for this theorem related to planar graphs?

Published on 16 Apr 2026 - 3:41

score 4.4k · Answer 5 · 2026-04-15 02:49:22

4.4k

Views

Prove there always exists a partition such that vertices in each part have even degree

Published on 15 Apr 2026 - 2:49

score 223 · Answer 6 · 2026-04-15 06:57:09

223

Views

How many trees can be drawn using$n$ vertices without rebuilding isomorphs?

Published on 15 Apr 2026 - 6:57

score 75 · Answer 7 · 2026-04-10 16:31:20

75

Views

Brook's theorem. Where I make a mistake?

Published on 10 Apr 2026 - 16:31

score 1.2k · Answer 8 · 2026-04-15 11:47:43

1.2k

Views

Triangular inequality in weighted graphs

Published on 15 Apr 2026 - 11:47

score 4.3k · Answer 9 · 2026-04-15 17:05:05

4.3k

Views

Number of connected components in a graph with n vertices and n-k edges

Published on 15 Apr 2026 - 17:05

score 668 · Answer 10 · 2026-05-14 07:16:08

668

Views

Spectrum of infinite d-regular tree

Published on 14 May 2026 - 7:16

score 183 · Answer 11 · 2026-04-14 23:16:42

183

Views

Induced cycle of odd length in a large graph

Published on 14 Apr 2026 - 23:16

score 3.5k · Answer 12 · 2026-04-13 03:17:06

3.5k

Views

calculating a chromatic polynomial

Published on 13 Apr 2026 - 3:17

score 840 · Answer 13 · 2026-04-14 14:54:52

Given a simple connected bipartite graph $G$ with degree of vertices equal to $k$, where $k\ge 2$. Prove that there is no cut vertex exist in $G$.

score 1.4k · Answer 14 · 2026-04-15 09:35:27

1.4k

Views

Given n vertices, how many unique graphs can be drawn with k edges?

Published on 15 Apr 2026 - 9:35

score 63 · Answer 15 · 2026-04-16 05:50:49

63

Views

concerning Graph Theory/subgraphs/ even degree

Published on 16 Apr 2026 - 5:50

List Question

Proof of Hamiltonian Cycle in a Complete Bipartite Graph

Number of spanning trees in $K_9$ with the degree of vertex $1$ being $4$

Vertex-transitive graphs and deletion of vertices

Can anyone give an example for this theorem related to planar graphs?

Prove there always exists a partition such that vertices in each part have even degree

How many trees can be drawn using$n$ vertices without rebuilding isomorphs?

Brook's theorem. Where I make a mistake?

Triangular inequality in weighted graphs

Number of connected components in a graph with n vertices and n-k edges

Spectrum of infinite d-regular tree

Induced cycle of odd length in a large graph

calculating a chromatic polynomial

Given a simple connected bipartite graph $G$ with degree of vertices equal to $k$, where $k\ge 2$. Prove that there is no cut vertex exist in $G$.

Given n vertices, how many unique graphs can be drawn with k edges?

concerning Graph Theory/subgraphs/ even degree

Trending Questions

Popular # Hahtags

Popular Questions