Question

Determining possible degree sequences.

score 51 · Answer 1 · 2026-04-08 16:19:16

51

Views

Determining possible degree sequences.

Published on 08 Apr 2026 - 16:19

score 516 · Answer 2 · 2026-04-16 22:31:32

516

Views

Matching number and covering number

Published on 16 Apr 2026 - 22:31

score 1.2k · Answer 3 · 2026-05-11 01:47:37

1.2k

Views

Binomial upper bound for the bi-color Ramsey numbers (Erdős-Szekeres)

Published on 11 May 2026 - 1:47

score 76 · Answer 4 · 2026-04-14 10:52:43

76

Views

Transformations that preserve nearest neighbours order

Published on 14 Apr 2026 - 10:52

score 1.1k · Answer 5 · 2019-11-25 18:12:12

1.1k

Views

How to prove that if G has no odd cycles then the chromatic number of G is 2

Published on 25 Nov 2019 - 18:12

score 614 · Answer 6 · 2026-04-15 08:10:09

614

Views

Show that an undirected graph of n vertices where every vertex has degree 2 is a cycle graph.

Published on 15 Apr 2026 - 8:10

score 4.6k · Answer 7 · 2026-04-15 18:23:03

4.6k

Views

Determine the number of Hamiltonian cycles in K2,3 and K4,4 and the existence of Euler trails

Published on 15 Apr 2026 - 18:23

score 1.8k · Answer 8 · 2026-04-16 02:56:17

1.8k

Views

Given an undirected graph, G=(V, E) with v vertices and e edges. Prove the following.

Published on 16 Apr 2026 - 2:56

score 81 · Answer 9 · 2026-04-16 07:56:41

Graph G =(V,E) contains two vertices of degree 1 and, for every k∈2,...,n−1, exactly one vertex of degree k. Show that n cannot be a multiple of 4.

score 95 · Answer 10 · 2026-04-16 01:29:38

95

Views

Is the infinite, binary, directed, connected, non-rooted graph countable?

Published on 16 Apr 2026 - 1:29

score 235 · Answer 11 · 2026-04-16 22:00:08

235

Views

Determining the number of simple undirected graphs.

Published on 16 Apr 2026 - 22:00

score 130 · Answer 12 · 2026-04-15 04:36:39

130

Views

Finding the number of graphs from the given condition.

Published on 15 Apr 2026 - 4:36

score 31 · Answer 13 · 2026-04-14 16:17:39

31

Views

Finding the required number of graphs.

Published on 14 Apr 2026 - 16:17

score 55 · Answer 14 · 2026-04-09 15:09:48

55

Views

Is this greedy algorithm optimal? How to prove it?

Published on 09 Apr 2026 - 15:09

score 145 · Answer 15 · 2026-05-11 04:13:55

145

Views

hamiltonian cycle in a directed simple graph

Published on 11 May 2026 - 4:13

List Question

Determining possible degree sequences.

Matching number and covering number

Binomial upper bound for the bi-color Ramsey numbers (Erdős-Szekeres)

Transformations that preserve nearest neighbours order

How to prove that if G has no odd cycles then the chromatic number of G is 2

Show that an undirected graph of n vertices where every vertex has degree 2 is a cycle graph.

Determine the number of Hamiltonian cycles in K2,3 and K4,4 and the existence of Euler trails

Given an undirected graph, G=(V, E) with v vertices and e edges. Prove the following.

Graph G =(V,E) contains two vertices of degree 1 and, for every k∈2,...,n−1, exactly one vertex of degree k. Show that n cannot be a multiple of 4.

Is the infinite, binary, directed, connected, non-rooted graph countable?

Determining the number of simple undirected graphs.

Finding the number of graphs from the given condition.

Finding the required number of graphs.

Is this greedy algorithm optimal? How to prove it?

hamiltonian cycle in a directed simple graph

Trending Questions

Popular # Hahtags

Popular Questions