Edge partition of planar sraphs into two outerplanar graphs

DOI10.1145/1060590.1060666MaRDI QIDQ3581445zbMATH OpenOpenAlexFDO

Authors Daniel Gonçalves

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

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(15)

• New results on edge partitions of 1-plane graphs
• Thickness and outerthickness for embedded graphs
• Monochromatic subgraphs in iterated triangulations
• Planar Ramsey graphs
• Planar graphs have 1-string representations
• An annotated bibliography on 1-planarity
• Facial parity edge colouring of plane pseudographs
• Edge Partitions and Visibility Representations of 1-planar Graphs
• On partitioning the edges of 1-plane graphs
• Ramsey properties of products of chains
• Edge partitions of optimal 2-plane and 3-plane graphs
• An improved algorithm for finding maximum outerplanar subgraphs
• On the uncrossed number of graphs
• Separating path systems for cubic graphs and for complete bipartite graphs
• Bounding tree-width via contraction on the projective plane and torus

This page was built for publication: Edge partition of planar sraphs into two outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581445)