On maximal planarization of nonplanar graphs

DOI10.1109/TCS.1986.1085997MaRDI QIDQ3799645zbMATH OpenFDO

Authors Krishnaiyan Thulasiraman, R. Jayakumar, M. N. S. Swamy

Publication date 1986

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCS.1986.1085997

zbMATH Keywords

complete graphmaximal planar subgraphnonplanar graphplanarization algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A linear algorithm for the maximal planar subgraph problem
• A linear time algorithm for finding maximal planar subgraphs
• A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
• A simple recognition of maximal planar graphs
• An algorithm for the characterization of the nonplanarity of a maximal graphical partition

Cited in

(11)

• A simple recognition of maximal planar graphs
• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• Non-hamiltonian 5 4-tough maximal planar graphs
• Special graph representation and visualization of semantic networks
• Re-embeddings of Maximum 1-Planar Graphs
• scientific article; zbMATH DE number 5543080 (Why is no real title available?)
• The effect of planarization on width
• The effect of planarization on width
• The maximal f-dependent set problem for planar graphs is in NC
• O(n2) algorithms for graph planarization
• The maximal \(f\)-dependent set problem for planar graphs is in NC

This page was built for publication: On maximal planarization of nonplanar graphs

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