Question

$G$ is a forest if and only if every connected subgraph is induced

score 581 · Answer 1 · 2019-05-17 23:45:27

581

Views

$G$ is a forest if and only if every connected subgraph is induced

Published on 17 May 2019 - 23:45

score 737 · Answer 2 · 2026-03-25 13:13:32

737

Views

Can you prove $K_{3,3}$ is not planar without the Jordan Curve Theorem?

Published on 25 Mar 2026 - 13:13

score 409 · Answer 3 · 2019-05-18 14:03:46

409

Views

Chromatic index of planar 4-regular graphs

Published on 18 May 2019 - 14:03

score 388 · Answer 4 · 2019-05-18 23:35:10

388

Views

edge deletions and spanning subgraphs

Published on 18 May 2019 - 23:35

score 136 · Answer 5 · 2026-04-01 20:25:31

136

Views

Minimal one-step distance set of vertices to all vertices

Published on 01 Apr 2026 - 20:25

score 74 · Answer 6 · 2026-04-06 07:17:41

74

Views

Spectral measure of a finite graph

Published on 06 Apr 2026 - 7:17

score 37 · Answer 7 · 2019-05-19 11:44:44

37

Views

Confusion about the definition of a graph property and it's relation to $G(n,p)$

Published on 19 May 2019 - 11:44

score 147 · Answer 8 · 2026-03-31 14:25:05

147

Views

Why are data points which are “close” should have a “similar” label?

Published on 31 Mar 2026 - 14:25

score 130 · Answer 9 · 2019-05-19 17:33:47

130

Views

Knowing every odd circuit in a graph is a triangle, prove $\chi(G) \le 4$

Published on 19 May 2019 - 17:33

score 8.7k · Answer 10 · 2019-05-19 21:43:36

8.7k

Views

Prove that a directed graph with no cycles has at least one node of indegree zero

Published on 19 May 2019 - 21:43

score 1.1k · Answer 11 · 2019-05-19 23:51:47

1.1k

Views

The chromatic number of a graph is at most its circumference

Published on 19 May 2019 - 23:51

score 425 · Answer 12 · 2026-03-28 10:31:22

425

Views

Self-study Graph theory

Published on 28 Mar 2026 - 10:31

score 302 · Answer 13 · 2019-05-20 16:02:07

302

Views

Prove that a NxN grid can be colored using n colors such that each color appear once each row and column

Published on 20 May 2019 - 16:02

score 392 · Answer 14 · 2019-05-20 17:12:35

392

Views

Does edge contraction increases the degree of a regular graph

Published on 20 May 2019 - 17:12

score 35 · Answer 15 · 2026-03-25 15:49:53

35

Views

Can a $k$-regular graph with $99$ vertices $(G=(99,E))$ be a bipartite graph?

Published on 25 Mar 2026 - 15:49

List Question

$G$ is a forest if and only if every connected subgraph is induced

Can you prove $K_{3,3}$ is not planar without the Jordan Curve Theorem?

Chromatic index of planar 4-regular graphs

edge deletions and spanning subgraphs

Minimal one-step distance set of vertices to all vertices

Spectral measure of a finite graph

Confusion about the definition of a graph property and it's relation to $G(n,p)$

Why are data points which are “close” should have a “similar” label?

Knowing every odd circuit in a graph is a triangle, prove $\chi(G) \le 4$

Prove that a directed graph with no cycles has at least one node of indegree zero

The chromatic number of a graph is at most its circumference

Self-study Graph theory

Prove that a NxN grid can be colored using n colors such that each color appear once each row and column

Does edge contraction increases the degree of a regular graph

Can a $k$-regular graph with $99$ vertices $(G=(99,E))$ be a bipartite graph?

Trending Questions

Popular # Hahtags

Popular Questions