Question

Is a maximal planar bipartite graph containing cut vertices isomorphic to a star?

score 216 · Answer 1 · 2022-10-03 03:52:38

216

Views

Is a maximal planar bipartite graph containing cut vertices isomorphic to a star?

Published on 03 Oct 2022 - 3:52

score 44 · Answer 2 · 2026-03-29 14:06:46

44

Views

Can a penny graph be inflated to uniformly cover a circumscribed circle?

Published on 29 Mar 2026 - 14:06

score 79 · Answer 3 · 2026-03-27 03:41:51

79

Views

Do "possible face sets" of planar graphs satisfy the exchange property?

Published on 27 Mar 2026 - 3:41

score 52 · Answer 4 · 2022-10-14 14:59:46

52

Views

Find amount of vertice of grade 3 or 4 in planar graph

Published on 14 Oct 2022 - 14:59

score 222 · Answer 5 · 2026-03-27 23:48:09

222

Views

Why is the number of edges of a $C_5$-free planar graph with $n$ vertices at most $\frac{12n-33}{5}$ where $n\in\{11,12,13\}$?

Published on 27 Mar 2026 - 23:48

score 87 · Answer 6 · 2022-10-28 16:13:38

87

Views

Local equivalency of ring graphs and 2xn grid graphs

Published on 28 Oct 2022 - 16:13

score 43 · Answer 7 · 2026-03-30 07:05:49

43

Views

Optimize distances between vertices in graph theory

Published on 30 Mar 2026 - 7:05

score 122 · Answer 8 · 2026-03-29 17:27:07

122

Views

Vertex minors of paths

Published on 29 Mar 2026 - 17:27

score 125 · Answer 9 · 2022-11-04 14:57:55

125

Views

Show that a graph has at least two different dual graphs

Published on 04 Nov 2022 - 14:57

score 55 · Answer 10 · 2022-11-05 15:49:35

55

Views

Ordered sequences of edges such that vertices appear an even number of times

Published on 05 Nov 2022 - 15:49

score 60 · Answer 11 · 2022-11-08 09:31:27

60

Views

Crossing number of 3-regular graphs

Published on 08 Nov 2022 - 9:31

score 112 · Answer 12 · 2022-11-09 08:50:51

112

Views

How to construct a planar graph (or a class of planar graphs) with minimum degree 5 of diameter 2?

Published on 09 Nov 2022 - 8:50

score 81 · Answer 13 · 2022-11-11 17:40:28

81

Views

Convert a nonplanar graph into a planar one

Published on 11 Nov 2022 - 17:40

score 14 · Answer 14 · 2022-11-12 17:37:34

14

Views

In planar graph, for any vertex v, it's possible to find an embedding in which v is in unbounded face

Published on 12 Nov 2022 - 17:37

score 15 · Answer 15 · 2026-03-30 00:22:53

15

Views

Find sequence of point from $u$ to $v$ such that each is at distance $d(u,v) = t$ with $t \in [1,2]$.

Published on 30 Mar 2026 - 0:22

List Question

Is a maximal planar bipartite graph containing cut vertices isomorphic to a star?

Can a penny graph be inflated to uniformly cover a circumscribed circle?

Do "possible face sets" of planar graphs satisfy the exchange property?

Find amount of vertice of grade 3 or 4 in planar graph

Why is the number of edges of a $C_5$-free planar graph with $n$ vertices at most $\frac{12n-33}{5}$ where $n\in\{11,12,13\}$?

Local equivalency of ring graphs and 2xn grid graphs

Optimize distances between vertices in graph theory

Vertex minors of paths

Show that a graph has at least two different dual graphs

Ordered sequences of edges such that vertices appear an even number of times

Crossing number of 3-regular graphs

How to construct a planar graph (or a class of planar graphs) with minimum degree 5 of diameter 2?

Convert a nonplanar graph into a planar one

In planar graph, for any vertex v, it's possible to find an embedding in which v is in unbounded face

Find sequence of point from $u$ to $v$ such that each is at distance $d(u,v) = t$ with $t \in [1,2]$.

Trending Questions

Popular # Hahtags

Popular Questions