Question

The Caravan Problem

score 88 · Answer 1 · 2023-03-22 23:28:21

88

Views

The Caravan Problem

Published on 22 Mar 2023 - 23:28

score 85 · Answer 2 · 2023-03-27 04:20:13

85

Views

Argue that in a planar graph on n nodes there is an independent set of at least n/8 nodes, each of degree at most 11.

Published on 27 Mar 2023 - 4:20

score 64 · Answer 3 · 2023-03-30 10:01:15

64

Views

Does a quadrangulation with minimum degree $3$ contain either a $(3,3)$ edge or a $(3,4)$ edge$?$

Published on 30 Mar 2023 - 10:01

score 86 · Answer 4 · 2023-03-31 03:23:21

86

Views

Queue number above 2 for planar graphs?

Published on 31 Mar 2023 - 3:23

score 50 · Answer 5 · 2023-03-31 15:43:45

50

Views

Let $n\geq 3$. Is there a connected, planar, bipartite graph with $n$ regions and $n$ vertices?

Published on 31 Mar 2023 - 15:43

score 35 · Answer 6 · 2026-03-26 14:19:14

35

Views

Question about "growing layers of a planar graphs"

Published on 26 Mar 2026 - 14:19

score 217 · Answer 7 · 2026-03-25 19:03:18

217

Views

The connectedness of dual graph

Published on 25 Mar 2026 - 19:03

score 184 · Answer 8 · 2023-04-11 07:59:42

184

Views

Can we construct a class of planar graphs with minimum degree $5$ (or even $5$-connected planar graphs) with diameter 3?

Published on 11 Apr 2023 - 7:59

score 50 · Answer 9 · 2023-04-15 21:33:49

50

Views

Counting the number of faces of non-connected planar graph

Published on 15 Apr 2023 - 21:33

score 32 · Answer 10 · 2023-04-17 18:49:27

32

Views

Given several $a_i$-$r$ paths in a planar graph how ``balanced" of a tree rooted at $r$ can I make?

Published on 17 Apr 2023 - 18:49

score 68 · Answer 11 · 2026-03-26 01:10:29

68

Views

Given a directed graph, can you determine if it can be drawn as a planar graph?

Published on 26 Mar 2026 - 1:10

score 244 · Answer 12 · 2023-04-25 07:08:31

244

Views

Does a maximal planar graph with number of vertices $\ge$ 6 always have a vertex of degree exactly 5?

Published on 25 Apr 2023 - 7:08

score 26 · Answer 13 · 2026-03-26 16:06:49

26

Views

Inverse of image connected component graph labeling

Published on 26 Mar 2026 - 16:06

score 211 · Answer 14 · 2026-03-25 15:43:04

211

Views

A periodic layout for the Petersen graph

Published on 25 Mar 2026 - 15:43

score 69 · Answer 15 · 2023-05-05 20:08:01

69

Views

Find segment x on the secant circles below

Published on 05 May 2023 - 20:08

List Question

The Caravan Problem

Argue that in a planar graph on n nodes there is an independent set of at least n/8 nodes, each of degree at most 11.

Does a quadrangulation with minimum degree $3$ contain either a $(3,3)$ edge or a $(3,4)$ edge$?$

Queue number above 2 for planar graphs?

Let $n\geq 3$. Is there a connected, planar, bipartite graph with $n$ regions and $n$ vertices?

Question about "growing layers of a planar graphs"

The connectedness of dual graph

Can we construct a class of planar graphs with minimum degree $5$ (or even $5$-connected planar graphs) with diameter 3?

Counting the number of faces of non-connected planar graph

Given several $a_i$-$r$ paths in a planar graph how ``balanced" of a tree rooted at $r$ can I make?

Given a directed graph, can you determine if it can be drawn as a planar graph?

Does a maximal planar graph with number of vertices $\ge$ 6 always have a vertex of degree exactly 5?

Inverse of image connected component graph labeling

A periodic layout for the Petersen graph

Find segment x on the secant circles below

Trending Questions

Popular # Hahtags

Popular Questions