Question

A graph with max 5 nodes that fulfils the folowing requirements

score 70 · Answer 1 · 2018-12-08 23:07:37

70

Views

A graph with max 5 nodes that fulfils the folowing requirements

Published on 08 Dec 2018 - 23:07

score 2.2k · Answer 2 · 2018-12-09 00:36:59

2.2k

Views

Draw a planar graph with two vertices of degree 3 and four vertices of degree 5, if possible.

Published on 09 Dec 2018 - 0:36

score 178 · Answer 3 · 2026-03-29 11:41:36

178

Views

Interesting Graph Problem?

Published on 29 Mar 2026 - 11:41

score 21 · Answer 4 · 2026-04-01 04:25:29

21

Views

Clarify the steps: what happened in this mathematical modelling of TSP?

Published on 01 Apr 2026 - 4:25

score 46 · Answer 5 · 2026-03-25 06:24:54

46

Views

Show that there are k directed walks from a to b in gamma having no common directed edge pairwise

Published on 25 Mar 2026 - 6:24

score 112 · Answer 6 · 2026-03-25 06:05:50

112

Views

Parity of vertex cover for a graph with 2p vertices

Published on 25 Mar 2026 - 6:05

score 44 · Answer 7 · 2018-12-09 14:27:17

44

Views

Prove or disprove: If graph $G$ has at most $3n-1$ edges, then $\chi(G) \leq 6$

Published on 09 Dec 2018 - 14:27

score 1.2k · Answer 8 · 2026-03-25 10:55:39

1.2k

Views

How to show that complement a of regular graph is a Hamiltonian graph?

Published on 25 Mar 2026 - 10:55

score 563 · Answer 9 · 2018-12-09 16:01:24

563

Views

The minimum edge cover of a tree is at least the maximum degree

Published on 09 Dec 2018 - 16:01

score 891 · Answer 10 · 2018-12-09 17:01:19

891

Views

Prove that the even cycles are 2-list-colorable.

Published on 09 Dec 2018 - 17:01

score 939 · Answer 11 · 2026-03-28 12:13:35

939

Views

Coloring grid points with two colors

Published on 28 Mar 2026 - 12:13

score 519 · Answer 12 · 2026-03-25 08:07:38

519

Views

Is there a non-planar, non-hamiltonian and eulerian graph?

Published on 25 Mar 2026 - 8:07

score 474 · Answer 13 · 2018-12-10 03:12:25

474

Views

let the girth of G is at least 2k. Prove that the diameter of Gis at least k.

Published on 10 Dec 2018 - 3:12

score 20 · Answer 14 · 2018-12-10 05:07:54

20

Views

Let M be a matching of T, prove that M< N(T) - $\triangle$ (T).

Published on 10 Dec 2018 - 5:07

score 1.1k · Answer 15 · 2018-12-10 05:32:24

1.1k

Views

Graph Theory - Show that every graph with at most three cycles is planar

Published on 10 Dec 2018 - 5:32

List Question

A graph with max 5 nodes that fulfils the folowing requirements

Draw a planar graph with two vertices of degree 3 and four vertices of degree 5, if possible.

Interesting Graph Problem?

Clarify the steps: what happened in this mathematical modelling of TSP?

Show that there are k directed walks from a to b in gamma having no common directed edge pairwise

Parity of vertex cover for a graph with 2p vertices

Prove or disprove: If graph $G$ has at most $3n-1$ edges, then $\chi(G) \leq 6$

How to show that complement a of regular graph is a Hamiltonian graph?

The minimum edge cover of a tree is at least the maximum degree

Prove that the even cycles are 2-list-colorable.

Coloring grid points with two colors

Is there a non-planar, non-hamiltonian and eulerian graph?

let the girth of G is at least 2k. Prove that the diameter of Gis at least k.

Let M be a matching of T, prove that M< N(T) - $\triangle$ (T).

Graph Theory - Show that every graph with at most three cycles is planar

Trending Questions

Popular # Hahtags

Popular Questions