Question

Random graph process

score 502 · Answer 1 · 2026-03-25 06:16:22

502

Views

Random graph process

Published on 25 Mar 2026 - 6:16

score 567 · Answer 2 · 2018-04-03 16:47:46

567

Views

$0–1$ incidence matrix is totally unimodular then $G$ is bipartite.

Published on 03 Apr 2018 - 16:47

score 186 · Answer 3 · 2026-03-26 19:57:27

186

Views

Conditions for Graphic Matroids

Published on 26 Mar 2026 - 19:57

score 85 · Answer 4 · 2018-04-04 01:47:09

85

Views

$L$ be the Laplacian of $G$ with maximum eigenvalue $\lambda_1$, then $\lambda_1 \leq n$.

Published on 04 Apr 2018 - 1:47

score 1.7k · Answer 5 · 2018-04-04 01:55:41

1.7k

Views

How to better prove this statement? Let G be a graph with $n$ vertices and $k > {n-1 \choose 2}$ edges. Then G is connected

Published on 04 Apr 2018 - 1:55

score 325 · Answer 6 · 2018-04-04 16:02:57

325

Views

Has a graph got at least one vertex, where $\deg(i) = \frac{n-1}{2}$?

Published on 04 Apr 2018 - 16:02

score 1.1k · Answer 7 · 2018-04-04 19:12:39

1.1k

Views

If every block in graph G is eulerian, is G necessarily eulerian?

Published on 04 Apr 2018 - 19:12

score 942 · Answer 8 · 2026-03-22 22:40:53

942

Views

planar graphs and number of faces

Published on 22 Mar 2026 - 22:40

score 447 · Answer 9 · 2026-03-27 10:42:56

447

Views

When is a planar embedding unique?

Published on 27 Mar 2026 - 10:42

score 840 · Answer 10 · 2018-04-04 20:44:13

840

Views

Graph Theory: (Open) Ear Decomposition Has Number of Ears Equal to Circuit Rank / Nullity / Cyclomatic Number

Published on 04 Apr 2018 - 20:44

score 219 · Answer 11 · 2018-04-04 21:09:20

219

Views

Definition of weakly chordal graphs and difference to Berge graph

Published on 04 Apr 2018 - 21:09

score 125 · Answer 12 · 2018-04-05 03:27:34

125

Views

Can a 6 vertex graph whose complement contains 2 components with 3 vertices each ever be planar?

Published on 05 Apr 2018 - 3:27

score 380 · Answer 13 · 2026-03-24 23:44:14

380

Views

Find the number of faces

Published on 24 Mar 2026 - 23:44

score 188 · Answer 14 · 2026-03-25 04:39:35

188

Views

Reference to extended Frucht's theorem: $\operatorname{Aut}(\Gamma)=G_1$ and $\operatorname{Aut}(\Gamma-e)=G_2$

Published on 25 Mar 2026 - 4:39

score 255 · Answer 15 · 2026-03-25 19:19:11

255

Views

Regular graphs and eigenvectors

Published on 25 Mar 2026 - 19:19

List Question

Random graph process

$0–1$ incidence matrix is totally unimodular then $G$ is bipartite.

Conditions for Graphic Matroids

$L$ be the Laplacian of $G$ with maximum eigenvalue $\lambda_1$, then $\lambda_1 \leq n$.

How to better prove this statement? Let G be a graph with $n$ vertices and $k > {n-1 \choose 2}$ edges. Then G is connected

Has a graph got at least one vertex, where $\deg(i) = \frac{n-1}{2}$?

If every block in graph G is eulerian, is G necessarily eulerian?

planar graphs and number of faces

When is a planar embedding unique?

Graph Theory: (Open) Ear Decomposition Has Number of Ears Equal to Circuit Rank / Nullity / Cyclomatic Number

Definition of weakly chordal graphs and difference to Berge graph

Can a 6 vertex graph whose complement contains 2 components with 3 vertices each ever be planar?

Find the number of faces

Reference to extended Frucht's theorem: $\operatorname{Aut}(\Gamma)=G_1$ and $\operatorname{Aut}(\Gamma-e)=G_2$

Regular graphs and eigenvectors

Trending Questions

Popular # Hahtags

Popular Questions