Outerplanar partitions of planar graphs

DOI10.1006/jctb.1996.0043zbMath0858.05040OpenAlexW2152021248MaRDI QIDQ1924146

Kiran S. Kedlaya

Publication date: 31 March 1997

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1996.0043

zbMATH Keywords

embeddingplanar graphouterplanar graphedge-partitionWhitney's theoremconjecture of Chartrand, Geller and Hedetniemiouterplanar partitionsouterplanar subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

An annotated bibliography on 1-planarity ⋮ Bounding tree-width via contraction on the projective plane and torus ⋮ Outerplanar Turán numbers of cycles and paths ⋮ New results on edge partitions of 1-plane graphs ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ On partitioning the edges of 1-plane graphs ⋮ Thickness and outerthickness for embedded graphs ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs ⋮ Surfaces, tree-width, clique-minors, and partitions

This page was built for publication: Outerplanar partitions of planar graphs