Planarizing Graphs - A Survey and Annotated Bibliography
From MaRDI portal
Publication:2701748
DOI10.7155/jgaa.00032zbMath0966.05022MaRDI QIDQ2701748
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
algorithms; thickness; crossing number; planar graph; simple graph; planarization; graph parameters; vertex splitting; vertex deletion
01A70: Biographies, obituaries, personalia, bibliographies
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Crossing numbers of Sierpiński‐like graphs, SPLITTING NUMBER is NP-complete, Planar crossing numbers of graphs of bounded genus, Crossing number and weighted crossing number of near-planar graphs, A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class, A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks, Worst case analysis of a greedy algorithm for graph thickness, Non-planar core reduction of graphs, Planarization and fragmentability of some classes of graphs, A simulated annealing algorithm for determining the thickness of a graph, Heuristics for the maximum outerplanar subgraph problem, Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs, Graph-Based Generation of Referring Expressions, 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
