Question

Proving the chromatic polynomial of a clique using induction

score 353 · Answer 1 · 2026-04-01 15:57:05

353

Views

Proving the chromatic polynomial of a clique using induction

Published on 01 Apr 2026 - 15:57

score 21 · Answer 2 · 2019-06-16 11:27:18

Determine the number of coloring of the circuit $C_7$ with x colors so that no adjacent vertices have identical colors.

score 405 · Answer 3 · 2026-03-25 06:08:19

405

Views

Solving Labyrinth maze using Dijkstra and adjacency -- Alphabet Soup

Published on 25 Mar 2026 - 6:08

score 147 · Answer 4 · 2026-04-12 21:30:07

147

Views

Finding the dependence of maximum vertex degree on k-colorability

Published on 12 Apr 2026 - 21:30

score 760 · Answer 5 · 2019-06-16 19:58:17

760

Views

Graph Processing: travel to each node at least once, start and end at specific (same) node?

Published on 16 Jun 2019 - 19:58

score 892 · Answer 6 · 2019-06-17 07:34:52

892

Views

Can the following picture be drawn without lifting the pen from the paper or retracting?

Published on 17 Jun 2019 - 7:34

score 1.3k · Answer 7 · 2019-06-17 10:20:06

1.3k

Views

How to show that the number of triangles in G is $\frac{1}{6}Tr(A^3)$

Published on 17 Jun 2019 - 10:20

score 71 · Answer 8 · 2026-04-11 22:06:35

71

Views

Definition of a cut

Published on 11 Apr 2026 - 22:06

score 88 · Answer 9 · 2026-04-12 16:37:28

88

Views

How to show that there is at least one triangle in G

Published on 12 Apr 2026 - 16:37

score 171 · Answer 10 · 2026-03-28 16:03:59

171

Views

Hamiltonian circuits on rectangular graphs

Published on 28 Mar 2026 - 16:03

score 70 · Answer 11 · 2019-06-17 16:06:39

70

Views

Maximal number of edges in a graph with $n$ vertices and $p$ components

Published on 17 Jun 2019 - 16:06

score 228 · Answer 12 · 2026-03-25 11:03:25

228

Views

Existence of graph with high minimum degree and domination number $\Omega(\ln n)$.

Published on 25 Mar 2026 - 11:03

score 123 · Answer 13 · 2019-06-17 17:23:49

Condition on $p, q, r$ that is equivalent to 'the complete tripartite graph $K_{p, q, r}$ has a perfect matching'

score 1.3k · Answer 14 · 2026-04-13 04:56:30

1.3k

Views

Eigenvector centrality as a limiting case of Katz centrality

Published on 13 Apr 2026 - 4:56

score 113 · Answer 15 · 2019-06-18 10:49:09

113

Views

Recursive relations of number spanning trees of a complete graph with given degree for a fixed vertex

Published on 18 Jun 2019 - 10:49

List Question

Proving the chromatic polynomial of a clique using induction

Determine the number of coloring of the circuit $C_7$ with x colors so that no adjacent vertices have identical colors.

Solving Labyrinth maze using Dijkstra and adjacency -- Alphabet Soup

Finding the dependence of maximum vertex degree on k-colorability

Graph Processing: travel to each node at least once, start and end at specific (same) node?

Can the following picture be drawn without lifting the pen from the paper or retracting?

How to show that the number of triangles in G is $\frac{1}{6}Tr(A^3)$

Definition of a cut

How to show that there is at least one triangle in G

Hamiltonian circuits on rectangular graphs

Maximal number of edges in a graph with $n$ vertices and $p$ components

Existence of graph with high minimum degree and domination number $\Omega(\ln n)$.

Condition on $p, q, r$ that is equivalent to 'the complete tripartite graph $K_{p, q, r}$ has a perfect matching'

Eigenvector centrality as a limiting case of Katz centrality

Recursive relations of number spanning trees of a complete graph with given degree for a fixed vertex

Trending Questions

Popular # Hahtags

Popular Questions