The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
From MaRDI portal
Publication:1910589
DOI10.1016/0012-365X(94)00326-EzbMath0845.05032OpenAlexW2066623726MaRDI QIDQ1910589
Don Coppersmith, Robert J. Cimikowski
Publication date: 26 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00326-e
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (max. 100)
An algorithmic metatheorem for directed treewidth ⋮ A simulated annealing algorithm for the maximum planar subgraph problem ⋮ Coloring the square of maximal Planar graphs with diameter two ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Finding Triangles for Maximum Planar Subgraphs ⋮ An analysis of heuristics for graph planarization ⋮ Heuristics for the maximum outerplanar subgraph problem
Cites Work
This page was built for publication: The sizes of maximal planar, outerplanar, and bipartite planar subgraphs
