Name
Abstract | ||
|---|---|---|
A $3$-connected graph $G$ is essentially $4$-connected if, for any $3$-cut $S\subseteq V(G)$ of $G$, at most one component of $G-S$ contains at least two vertices. We prove that every essentially $4$-connected maximal planar graph $G$ on $n$ vertices contains a cycle of length at least $\frac{2}{3}(n+4)$; moreover, this bound is sharp. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.7155/jgaa.00552 | J. Graph Algorithms Appl. |
DocType | Volume | Issue |
Journal | 25 | 1 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |
| Jochen Harant | 2 | 217 | 30.62 |
| Samuel Mohr | 3 | 0 | 0.34 |
| Jens M. Schmidt | 4 | 0 | 1.69 |