Question

How to prove that a graph has at least 2 degrees with an odd degree

score 198 · Answer 1 · 2018-05-02 18:12:30

198

Views

How to prove that a graph has at least 2 degrees with an odd degree

Published on 02 May 2018 - 18:12

score 196 · Answer 2 · 2018-05-02 19:04:11

196

Views

What is this question about planar graphs describing?

Published on 02 May 2018 - 19:04

score 47 · Answer 3 · 2018-05-02 19:14:38

47

Views

How I draw this Graphs?

Published on 02 May 2018 - 19:14

score 54 · Answer 4 · 2018-05-02 20:19:18

54

Views

The proof of adding edges without improving algebraic connectivity $\lambda_2$ of graph

Published on 02 May 2018 - 20:19

score 268 · Answer 5 · 2026-03-25 15:59:09

268

Views

Geometric Intuition of Simplical Sets

Published on 25 Mar 2026 - 15:59

score 637 · Answer 6 · 2026-03-26 03:33:06

637

Views

If G is k-vertex-connected then G-v is k-1-connected

Published on 26 Mar 2026 - 3:33

score 325 · Answer 7 · 2026-03-25 01:17:25

325

Views

Explaining recurrence for number of no-leaf subgraphs in $2 \times n$ grid.

Published on 25 Mar 2026 - 1:17

score 796 · Answer 8 · 2018-05-03 03:19:43

796

Views

Does having two edge-disjoint Hamiltonian paths imply having a Hamiltonian circuit?

Published on 03 May 2018 - 3:19

score 266 · Answer 9 · 2026-03-25 08:04:07

266

Views

Is this a counter example to the Eulerian Trail definition?

Published on 25 Mar 2026 - 8:04

score 51 · Answer 10 · 2026-03-27 18:27:51

51

Views

Is there any algorithm that can find all the path from s to t if we require the path to have a total weight of K.

Published on 27 Mar 2026 - 18:27

score 747 · Answer 11 · 2026-03-22 17:15:30

747

Views

Prove that grounded Laplacian/reduced conductance matrix is non-singular

Published on 22 Mar 2026 - 17:15

score 61 · Answer 12 · 2026-03-28 22:28:17

61

Views

dimension of graph $K_n$ as defined in Proofs from the book

Published on 28 Mar 2026 - 22:28

score 84 · Answer 13 · 2026-03-25 01:18:39

84

Views

If $d_G(v)≤k \; \forall \; v \in V(G)$, then there exists a matching with $≥\frac{|V(G)|}{2k}$ edges

Published on 25 Mar 2026 - 1:18

score 102 · Answer 14 · 2026-03-27 09:40:40

102

Views

list colouring of a rather big graph

Published on 27 Mar 2026 - 9:40

score 1.1k · Answer 15 · 2026-03-25 01:25:57

1.1k

Views

Obtaining a planar graph from a non-planar graph through vertex addition

Published on 25 Mar 2026 - 1:25

List Question

How to prove that a graph has at least 2 degrees with an odd degree

What is this question about planar graphs describing?

How I draw this Graphs?

The proof of adding edges without improving algebraic connectivity $\lambda_2$ of graph

Geometric Intuition of Simplical Sets

If G is k-vertex-connected then G-v is k-1-connected

Explaining recurrence for number of no-leaf subgraphs in $2 \times n$ grid.

Does having two edge-disjoint Hamiltonian paths imply having a Hamiltonian circuit?

Is this a counter example to the Eulerian Trail definition?

Is there any algorithm that can find all the path from s to t if we require the path to have a total weight of K.

Prove that grounded Laplacian/reduced conductance matrix is non-singular

dimension of graph $K_n$ as defined in Proofs from the book

If $d_G(v)≤k \; \forall \; v \in V(G)$, then there exists a matching with $≥\frac{|V(G)|}{2k}$ edges

list colouring of a rather big graph

Obtaining a planar graph from a non-planar graph through vertex addition

Trending Questions

Popular # Hahtags

Popular Questions