Planarizing Graphs - A Survey and Annotated Bibliography

DOI10.7155/jgaa.00032zbMath0966.05022OpenAlexW2111635834MaRDI QIDQ2701748

Annegret Liebers

Publication date: 19 February 2001

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48836

zbMATH Keywords

algorithmsthicknesscrossing numberplanar graphsimple graphplanarizationgraph parametersvertex splittingvertex deletion

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (25)

Graph-Based Generation of Referring Expressions ⋮ Planarization and fragmentability of some classes of graphs ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ An FPT algorithm for bipartite vertex splitting ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ On the skewness of products of graphs ⋮ Planar crossing numbers of graphs of bounded genus ⋮ On the skewness of the join of graphs ⋮ A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class ⋮ On the planar split thickness of graphs ⋮ Crossing numbers of Sierpiński‐like graphs ⋮ SPLITTING NUMBER is NP-complete ⋮ Crossing number and weighted crossing number of near-planar graphs ⋮ A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks ⋮ Properties of \(\pi\)-skew graphs with applications ⋮ An improved upper bound on the crossing number of the hypercube ⋮ Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method ⋮ Crossing and Weighted Crossing Number of Near-Planar Graphs ⋮ Worst case analysis of a greedy algorithm for graph thickness ⋮ Non-planar core reduction of graphs ⋮ A note on the crossing number of the cone of a graph ⋮ Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs ⋮ On the skewness of Cartesian products with trees ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ Heuristics for the maximum outerplanar subgraph problem

This page was built for publication: Planarizing Graphs - A Survey and Annotated Bibliography