Question

Graph Theory - Degree when parallel edges are present

score 1.1k · Answer 1 · 2018-03-28 15:35:19

1.1k

Views

Graph Theory - Degree when parallel edges are present

Published on 28 Mar 2018 - 15:35

score 1.6k · Answer 2 · 2026-03-24 23:46:16

1.6k

Views

Show that in a planar graph (no triangles) there exists a vertex with degree $\leq 3$

Published on 24 Mar 2026 - 23:46

score 82 · Answer 3 · 2026-03-27 04:16:38

82

Views

Is there a term for this graph construction? I replace several vertices by a single one.

Published on 27 Mar 2026 - 4:16

score 59 · Answer 4 · 2018-03-28 17:51:46

59

Views

Prove that removing $2 K_3$s from $K_5$ leaves a $C_4$

Published on 28 Mar 2018 - 17:51

score 82 · Answer 5 · 2026-03-25 06:10:18

82

Views

Proof that a $k$-regular bipartite graph has a $1$-factor

Published on 25 Mar 2026 - 6:10

score 76 · Answer 6 · 2026-03-25 07:47:53

76

Views

Constructing an isomorphism from dihedral group $D_5$ to Grötzsch graph automorphism group

Published on 25 Mar 2026 - 7:47

score 374 · Answer 7 · 2018-03-29 04:33:34

374

Views

Generalization of the Friendship Theorem in graphs?

Published on 29 Mar 2018 - 4:33

score 1.8k · Answer 8 · 2026-03-27 04:34:30

1.8k

Views

Algorithm to determine if a graph has more than one spanning tree

Published on 27 Mar 2026 - 4:34

score 588 · Answer 9 · 2026-03-23 01:02:05

588

Views

Minimum capacity cut reduction from digraph with two edge weight sets

Published on 23 Mar 2026 - 1:02

score 61 · Answer 10 · 2018-03-29 15:03:04

61

Views

Calculate the number of nearest neighbours in particular graphs on $\mathbb Z^d$

Published on 29 Mar 2018 - 15:03

score 358 · Answer 11 · 2018-03-29 16:22:07

358

Views

A tournament graph where all the in-degrees and out-degrees are different.

Published on 29 Mar 2018 - 16:22

score 131 · Answer 12 · 2026-03-25 17:36:44

131

Views

Assigning drivers to buses and routes

Published on 25 Mar 2026 - 17:36

score 292 · Answer 13 · 2018-03-29 20:19:34

292

Views

Give Vertex Orientations, Receive Edge Coloring?

Published on 29 Mar 2018 - 20:19

score 718 · Answer 14 · 2026-03-27 06:15:34

718

Views

Critical path algorithm

Published on 27 Mar 2026 - 6:15

score 1.4k · Answer 15 · 2026-03-25 01:17:41

1.4k

Views

Proving that every connected graph of order 4 that is not $K_{1,3}$ has a perfect matching.

Published on 25 Mar 2026 - 1:17

List Question

Graph Theory - Degree when parallel edges are present

Show that in a planar graph (no triangles) there exists a vertex with degree $\leq 3$

Is there a term for this graph construction? I replace several vertices by a single one.

Prove that removing $2 K_3$s from $K_5$ leaves a $C_4$

Proof that a $k$-regular bipartite graph has a $1$-factor

Constructing an isomorphism from dihedral group $D_5$ to Grötzsch graph automorphism group

Generalization of the Friendship Theorem in graphs?

Algorithm to determine if a graph has more than one spanning tree

Minimum capacity cut reduction from digraph with two edge weight sets

Calculate the number of nearest neighbours in particular graphs on $\mathbb Z^d$

A tournament graph where all the in-degrees and out-degrees are different.

Assigning drivers to buses and routes

Give Vertex Orientations, Receive Edge Coloring?

Critical path algorithm

Proving that every connected graph of order 4 that is not $K_{1,3}$ has a perfect matching.

Trending Questions

Popular # Hahtags

Popular Questions