List questions from graph-theory

Published on 19 Mar 2026 - 16:00

1.7k

Views

Formally what is an unlabeled graph? I have no problem defining labeled graphs with set theory, but can't do the same here.

Published on 23 Mar 2026 - 10:21

1.8k

Views

Graph Theory: paths of maximum length in a connected graph

Published on 28 Jan 2018 - 0:34

282

Views

Digraph with no even cycle

Published on 25 Mar 2026 - 0:56

102

Views

Is the graph described below bipartite?

Published on 20 Mar 2026 - 3:37

7.8k

Views

Proof for a graph has Euler tour iff each vertex has even degree

Published on 17 Mar 2026 - 19:10

503

Views

An enclosing polygon with minimum area

Published on 22 Mar 2026 - 10:15

579

Views

Is graph Planar?

Published on 22 Mar 2026 - 9:45

388

Views

Prove that an even order ($n=2k$) graph without cycle of order 3, has a size $m \le k^2$

Published on 23 Mar 2026 - 3:29

1.6k

Views

Prove that if number of edges is greater than ${n-1\choose 2}$, where n is the number of vertices, then G is connected

Published on 28 Jan 2018 - 19:58

1.1k

Views

Determine whether the graph below is isomorphic to Petersen graph.

Published on 19 Mar 2026 - 15:54

78

Views

Dynamic graphs as alternative representation of ODEs?

Published on 25 Mar 2026 - 1:22

138

Views

Number of edges after we copy all the vertices.

Published on 28 Jan 2018 - 20:54

34

Views

Showing that if $|N(u) \cap N(v)|=1 $ then Graph G is r regular.

Published on 28 Jan 2018 - 21:40

278

Views

Prove that cycle of length 3 exists in a 4-regular connected graph that has $3n+2, n \in N$ vertices

Published on 28 Jan 2018 - 22:44

List Question

Complete bipartite planar graphs

Formally what is an unlabeled graph? I have no problem defining labeled graphs with set theory, but can't do the same here.

Graph Theory: paths of maximum length in a connected graph

Digraph with no even cycle

Is the graph described below bipartite?

Proof for a graph has Euler tour iff each vertex has even degree

An enclosing polygon with minimum area

Is graph Planar?

Prove that an even order ($n=2k$) graph without cycle of order 3, has a size $m \le k^2$

Prove that if number of edges is greater than ${n-1\choose 2}$, where n is the number of vertices, then G is connected

Determine whether the graph below is isomorphic to Petersen graph.

Dynamic graphs as alternative representation of ODEs?

Number of edges after we copy all the vertices.

Showing that if $|N(u) \cap N(v)|=1 $ then Graph G is r regular.

Prove that cycle of length 3 exists in a 4-regular connected graph that has $3n+2, n \in N$ vertices

Trending Questions

Popular # Hahtags

Popular Questions