Question

Toughness of a graph

score 205 · Answer 1 · 2018-05-04 06:23:34

205

Views

Toughness of a graph

Published on 04 May 2018 - 6:23

score 398 · Answer 2 · 2018-05-04 11:12:12

398

Views

Planar representation of bipartite graphs and the degree of faces

Published on 04 May 2018 - 11:12

score 1.2k · Answer 3 · 2026-03-25 01:20:37

1.2k

Views

Is it true that, for a tree, rank of adjacency matrix is equal to twice the matching number?

Published on 25 Mar 2026 - 1:20

score 103 · Answer 4 · 2018-05-04 18:34:47

103

Views

Does the term 'graph' without descriptors refer to directed or undirected?

Published on 04 May 2018 - 18:34

score 590 · Answer 5 · 2018-05-04 19:07:43

590

Views

All vertices except $d+1$ have degree at most $d$, then it is ($d+1$)-colorable.

Published on 04 May 2018 - 19:07

score 7.3k · Answer 6 · 2026-03-26 09:20:45

7.3k

Views

Understanding the n-dimensional Simplex in Topology

Published on 26 Mar 2026 - 9:20

score 293 · Answer 7 · 2026-03-25 14:29:54

293

Views

3-Points on 3-vertex connected graph

Published on 25 Mar 2026 - 14:29

score 105 · Answer 8 · 2026-03-28 08:46:21

105

Views

Graph matching - normalize similarity matrix and decrease/increase uninformative/informative matches

Published on 28 Mar 2026 - 8:46

score 190 · Answer 9 · 2026-03-25 01:22:33

190

Views

Can every partial transversal be extended to a maximum partial transversal?

Published on 25 Mar 2026 - 1:22

score 53 · Answer 10 · 2018-05-06 01:41:24

53

Views

Sequence associated with degrees of graph

Published on 06 May 2018 - 1:41

score 281 · Answer 11 · 2018-05-06 12:29:48

281

Views

Towers 'n Tets problem.

Published on 06 May 2018 - 12:29

score 201 · Answer 12 · 2026-03-25 03:01:59

201

Views

How to apply Hall's Marriage Theorem given condition on vertex degrees

Published on 25 Mar 2026 - 3:01

score 253 · Answer 13 · 2018-05-06 17:20:44

253

Views

Vertex-connectivity of a not complete graph

Published on 06 May 2018 - 17:20

score 152 · Answer 14 · 2026-03-27 00:10:28

152

Views

number of ways putting m nonadjacent balls in a nnn chess board

Published on 27 Mar 2026 - 0:10

score 3.4k · Answer 15 · 2026-03-26 06:22:35

3.4k

Views

Prove cut-vertex $v$ in $G$ is not cut-vertex in $\overline G$

Published on 26 Mar 2026 - 6:22

List Question

Toughness of a graph

Planar representation of bipartite graphs and the degree of faces

Is it true that, for a tree, rank of adjacency matrix is equal to twice the matching number?

Does the term 'graph' without descriptors refer to directed or undirected?

All vertices except $d+1$ have degree at most $d$, then it is ($d+1$)-colorable.

Understanding the n-dimensional Simplex in Topology

3-Points on 3-vertex connected graph

Graph matching - normalize similarity matrix and decrease/increase uninformative/informative matches

Can every partial transversal be extended to a maximum partial transversal?

Sequence associated with degrees of graph

Towers 'n Tets problem.

How to apply Hall's Marriage Theorem given condition on vertex degrees

Vertex-connectivity of a not complete graph

number of ways putting m nonadjacent balls in a nnn chess board

Prove cut-vertex $v$ in $G$ is not cut-vertex in $\overline G$

Trending Questions

Popular # Hahtags

Popular Questions