Question

Prove that any loop-less undirected graph admits an acyclic orientation.

score 379 · Answer 1 · 2018-04-29 23:56:07

379

Views

Prove that any loop-less undirected graph admits an acyclic orientation.

Published on 29 Apr 2018 - 23:56

score 1.1k · Answer 2 · 2018-04-30 03:47:35

1.1k

Views

Calculating the lower bound on the chromatic number of a simple graph.

Published on 30 Apr 2018 - 3:47

score 3.1k · Answer 3 · 2018-04-30 09:32:22

3.1k

Views

Degree of the eighth vertex given the other degrees

Published on 30 Apr 2018 - 9:32

score 1.1k · Answer 4 · 2026-03-25 06:09:59

1.1k

Views

Spanning Trees in $K_{m,n}$

Published on 25 Mar 2026 - 6:09

score 405 · Answer 5 · 2026-03-27 12:20:13

405

Views

Is a morphism between graphs that doesn't respect adjacency a homomorphism but not a graph homomorphism?

Published on 27 Mar 2026 - 12:20

score 112 · Answer 6 · 2018-04-30 12:55:08

A tournament $T$ with $n=207$ vertices contains two vertices $u$ and $v$ such that there are at least $52$ distinct $u-v$ paths of length $2$ in $T$.

score 338 · Answer 7 · 2026-03-27 12:20:04

338

Views

Terminology: customary name of graph "smoothing"

Published on 27 Mar 2026 - 12:20

score 506 · Answer 8 · 2026-03-25 04:40:47

506

Views

Determine the independent sets of size 2 of G

Published on 25 Mar 2026 - 4:40

score 1.4k · Answer 9 · 2018-04-30 18:32:58

1.4k

Views

An $n$-hypercube is both $n$-vertex- and -edge-connected

Published on 30 Apr 2018 - 18:32

score 103 · Answer 10 · 2026-03-25 06:08:53

103

Views

Create a circuit based on a graph

Published on 25 Mar 2026 - 6:08

score 696 · Answer 11 · 2026-03-25 04:43:22

696

Views

show that if $G$ is a $2$-connected graph containing a vertex that is adjacent to at least three vertices of degree $2$, then $G$ is not Hamiltonian.

Published on 25 Mar 2026 - 4:43

score 492 · Answer 12 · 2026-03-27 10:44:27

492

Views

why the name stable set?

Published on 27 Mar 2026 - 10:44

score 633 · Answer 13 · 2026-03-25 03:00:46

633

Views

How to find the perfect matching?

Published on 25 Mar 2026 - 3:00

score 1.6k · Answer 14 · 2018-05-01 09:14:40

1.6k

Views

Minimum Vertex Cut

Published on 01 May 2018 - 9:14

score 1k · Answer 15 · 2018-05-01 11:07:57

1k

Views

Upper bound relating number of edges of a graph to it's chromatic number

Published on 01 May 2018 - 11:07

List Question

Prove that any loop-less undirected graph admits an acyclic orientation.

Calculating the lower bound on the chromatic number of a simple graph.

Degree of the eighth vertex given the other degrees

Spanning Trees in $K_{m,n}$

Is a morphism between graphs that doesn't respect adjacency a homomorphism but not a graph homomorphism?

A tournament $T$ with $n=207$ vertices contains two vertices $u$ and $v$ such that there are at least $52$ distinct $u-v$ paths of length $2$ in $T$.

Terminology: customary name of graph "smoothing"

Determine the independent sets of size 2 of G

An $n$-hypercube is both $n$-vertex- and -edge-connected

Create a circuit based on a graph

show that if $G$ is a $2$-connected graph containing a vertex that is adjacent to at least three vertices of degree $2$, then $G$ is not Hamiltonian.

why the name stable set?

How to find the perfect matching?

Minimum Vertex Cut

Upper bound relating number of edges of a graph to it's chromatic number

Trending Questions

Popular # Hahtags

Popular Questions