Edge partition of planar sraphs into two outerplanar graphs
From MaRDI portal
Publication:3581445
DOI10.1145/1060590.1060666zbMath1192.05113OpenAlexW2043015866MaRDI QIDQ3581445
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060666
Related Items (13)
Planar graphs have 1-string representations ⋮ Ramsey properties of products of chains ⋮ An annotated bibliography on 1-planarity ⋮ Bounding tree-width via contraction on the projective plane and torus ⋮ New results on edge partitions of 1-plane graphs ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Facial parity edge colouring of plane pseudographs ⋮ Monochromatic subgraphs in iterated triangulations ⋮ On partitioning the edges of 1-plane graphs ⋮ Thickness and outerthickness for embedded graphs ⋮ Edge partitions of optimal 2-plane and 3-plane graphs ⋮ Planar Ramsey graphs ⋮ Edge Partitions and Visibility Representations of 1-planar Graphs
This page was built for publication: Edge partition of planar sraphs into two outerplanar graphs
