Question

Show that if G is a disconnected graph containing exactly two odd vertices, then these odd vertices must be in the same component of G.

score 860 · Answer 1 · 2019-02-23 03:19:16

Show that if G is a disconnected graph containing exactly two odd vertices, then these odd vertices must be in the same component of G.

score 361 · Answer 2 · 2026-03-27 03:26:22

361

Views

Graphs with rational eigenvalues

Published on 27 Mar 2026 - 3:26

score 188 · Answer 3 · 2019-02-23 04:12:07

188

Views

What is champe's change / champe change swaps, fanning in graph theory?

Published on 23 Feb 2019 - 4:12

score 476 · Answer 4 · 2019-02-23 06:20:14

476

Views

Prove that there exists a $k$ such that the sequence obtained by listing each element of $S$ a total $k$ times is a degree sequence of some graph.

Published on 23 Feb 2019 - 6:20

score 149 · Answer 5 · 2026-03-26 03:09:37

149

Views

Set or list compression

Published on 26 Mar 2026 - 3:09

score 1.2k · Answer 6 · 2019-02-24 03:22:05

1.2k

Views

Number of edges of a non-planar graph with fixed number of vertex

Published on 24 Feb 2019 - 3:22

score 79 · Answer 7 · 2019-02-24 03:55:37

79

Views

Hamiltonian Prove.

Published on 24 Feb 2019 - 3:55

score 235 · Answer 8 · 2019-02-24 04:55:31

Construct a graph $G$ such that $G$ does not contain $K_r$ but $G$ is not $(r − 1)-$ partite for each $r \geq 3$

score 82 · Answer 9 · 2019-02-24 08:21:37

82

Views

Can we conclude that $G_1 \not ≅ G_2$?

Published on 24 Feb 2019 - 8:21

score 475 · Answer 10 · 2019-02-24 09:07:52

475

Views

Cliques of size four in graph

Published on 24 Feb 2019 - 9:07

score 121 · Answer 11 · 2026-03-27 05:34:42

121

Views

intersection of total orders

Published on 27 Mar 2026 - 5:34

score 590 · Answer 12 · 2019-02-24 13:58:56

590

Views

Graph is $2$-edge-connected, when vertices has even degrees

Published on 24 Feb 2019 - 13:58

score 328 · Answer 13 · 2019-02-24 21:29:26

328

Views

Graph Theory Exploration

Published on 24 Feb 2019 - 21:29

score 58 · Answer 14 · 2019-02-25 02:59:04

58

Views

Number of ways to pack $d$-dimensional hypercubes into an $n$-dimensional hypercube

Published on 25 Feb 2019 - 2:59

score 262 · Answer 15 · 2019-02-25 04:07:16

262

Views

Let $G$ be the graph obtained from $G_1 \cup G2$ by adding the edge $v_1v_2$ . Is $G$ Eulerian?

Published on 25 Feb 2019 - 4:07

List Question

Show that if G is a disconnected graph containing exactly two odd vertices, then these odd vertices must be in the same component of G.

Graphs with rational eigenvalues

What is champe's change / champe change swaps, fanning in graph theory?

Prove that there exists a $k$ such that the sequence obtained by listing each element of $S$ a total $k$ times is a degree sequence of some graph.

Set or list compression

Number of edges of a non-planar graph with fixed number of vertex

Hamiltonian Prove.

Construct a graph $G$ such that $G$ does not contain $K_r$ but $G$ is not $(r − 1)-$ partite for each $r \geq 3$

Can we conclude that $G_1 \not ≅ G_2$?

Cliques of size four in graph

intersection of total orders

Graph is $2$-edge-connected, when vertices has even degrees

Graph Theory Exploration

Number of ways to pack $d$-dimensional hypercubes into an $n$-dimensional hypercube

Let $G$ be the graph obtained from $G_1 \cup G2$ by adding the edge $v_1v_2$ . Is $G$ Eulerian?

Trending Questions

Popular # Hahtags

Popular Questions