Abstract
We prove that the size of the largest face of a 4-critical planar graph with δ≥4 is at most one half the number of its vertices. Letf(n) denote the maximum of the sizes of largest faces of all such graphs withn vertices (n sufficiently large). We present an infinite family of graphs that shows\(\mathop {\lim }\limits_{n \to \infty } \frac{{f(n)}}{n} = \frac{1}{2}\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. L. Abbott, M. Katchalski, andB. Zhou: Proof of a conjecture of Dirac concerning 4-critical planar graphs.Discrete Math.,132 (1994), 367–371.
H. L. Abbott andB. Zhou: The edge density of 4-critical planar graphs.Combinatorica,11 (1991), 185–189.
T. Gallai: Critical graphs. InTheory of Graphs and its Applications (Proc. Symp. Smolenice, 1963), 43–45, Publ. House Szech. Acad. Sci., 1964.
B. Grünbaum: The edge density of 4-critical planar graphs.Combinatorica,8 (1988), 137–139.
G. Koester: Note to a problem of T. Gallai and G. A. Dirac.Combinatorica,5 (1985), 227–228.
G. Koester: 4-critical 4-valent planar graphs constructed with crowns.Math. Scand.,67 (1990), 17–22.
G. Koester: On 4-critical planar graphs with high edge density.Discrete Math.,98 (1991), 147–151.
Author information
Authors and Affiliations
Additional information
All three authors gratefully acknowledge the support of the National Science and Engineering Research Council of Canada.
Rights and permissions
About this article
Cite this article
Abbott, H.L., Hare, D.R. & Zhou, B. Large faces in 4-critical planar graphs with minimum degree 4. Combinatorica 15, 455–467 (1995). https://doi.org/10.1007/BF01192518
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01192518