Question

1-factor in r-connected graph

score 916 · Answer 1 · 2019-05-14 19:38:07

916

Views

1-factor in r-connected graph

Published on 14 May 2019 - 19:38

score 144 · Answer 2 · 2019-05-14 23:31:29

144

Views

Coloring of rectangle $3\times 4$

Published on 14 May 2019 - 23:31

score 320 · Answer 3 · 2026-03-30 00:58:11

320

Views

Find the minimum positive integer $r$ for which there exists an $r$-regular graph $G$ such that $\kappa(G) \neq \lambda(G)$

Published on 30 Mar 2026 - 0:58

score 370 · Answer 4 · 2019-05-15 10:07:45

370

Views

Prove self-complementarity of regular graph with given order.

Published on 15 May 2019 - 10:07

score 223 · Answer 5 · 2026-03-25 04:40:09

223

Views

Maximum number of distinct triangles in complete graph such that each edge appears in exactly two triangles

Published on 25 Mar 2026 - 4:40

score 403 · Answer 6 · 2026-03-25 09:26:26

403

Views

Prove that if a graph is k-connected, then it is also k-edge-connected

Published on 25 Mar 2026 - 9:26

score 404 · Answer 7 · 2019-05-15 22:38:19

404

Views

Doubt in vertex connectivity less than edge connectivity proof

Published on 15 May 2019 - 22:38

score 93 · Answer 8 · 2019-05-16 00:04:20

93

Views

(generalization) Maximum number of edges without a cycle of length k

Published on 16 May 2019 - 0:04

score 570 · Answer 9 · 2026-03-26 04:51:19

570

Views

Cospectral graphs that are non-isomorphic and that only have simple eigenvalues

Published on 26 Mar 2026 - 4:51

score 49 · Answer 10 · 2026-03-25 17:25:03

49

Views

Counting hypermaps with following properties

Published on 25 Mar 2026 - 17:25

score 35 · Answer 11 · 2019-05-16 01:45:21

Prove that the degree of 2 vertices, which are the start and end of the longest path in a graph, are less than or equal to the length of the path

score 2.8k · Answer 12 · 2026-03-25 09:30:03

2.8k

Views

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

Published on 25 Mar 2026 - 9:30

score 88 · Answer 13 · 2019-05-16 06:26:32

88

Views

How do you find all minimal vertex cover of bipartite graph $G$?

Published on 16 May 2019 - 6:26

score 741 · Answer 14 · 2026-04-11 01:57:17

741

Views

Formulate a labeled directed graph

Published on 11 Apr 2026 - 1:57

score 101 · Answer 15 · 2019-05-16 10:33:22

101

Views

Rosa's theorem about tree T with m edges to decompose a complete with 2m+1 vertice

Published on 16 May 2019 - 10:33

List Question

1-factor in r-connected graph

Coloring of rectangle $3\times 4$

Find the minimum positive integer $r$ for which there exists an $r$-regular graph $G$ such that $\kappa(G) \neq \lambda(G)$

Prove self-complementarity of regular graph with given order.

Maximum number of distinct triangles in complete graph such that each edge appears in exactly two triangles

Prove that if a graph is k-connected, then it is also k-edge-connected

Doubt in vertex connectivity less than edge connectivity proof

(generalization) Maximum number of edges without a cycle of length k

Cospectral graphs that are non-isomorphic and that only have simple eigenvalues

Counting hypermaps with following properties

Prove that the degree of 2 vertices, which are the start and end of the longest path in a graph, are less than or equal to the length of the path

prove that if $G$ is a graph with $n$ vertices and $\delta(G) \geq (n - 1) / 2$ then $G$ is $\frac{n-1}{2}$-edge-connected

How do you find all minimal vertex cover of bipartite graph $G$?

Formulate a labeled directed graph

Rosa's theorem about tree T with m edges to decompose a complete with 2m+1 vertice

Trending Questions

Popular # Hahtags

Popular Questions