Abstract
Let G be a 3-connected planar graph and let U ⊆ V(G). It is shown that G contains a K2, t minor such that t is large and each vertex of degree 2 in K2, t corresponds to some vertex of U if and only if there is no small face cover of U. This result cannot be extended to 2-connected planar graphs. © 2002 Elsevier Science (USA).
Author supplied keywords
Cite
CITATION STYLE
APA
Böhme, T., & Mohar, B. (2002). Labeled K2, t minors in plane graphs. Journal of Combinatorial Theory. Series B, 84(2), 291–300. https://doi.org/10.1006/jctb.2001.2083
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free