Pages that link to "Item:Q2701748"
From MaRDI portal
The following pages link to Planarizing Graphs - A Survey and Annotated Bibliography (Q2701748):
Displaying 23 items.
- Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
- Crossing number and weighted crossing number of near-planar graphs (Q548655) (← links)
- A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class (Q924681) (← links)
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
- Non-planar core reduction of graphs (Q1011763) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Properties of \(\pi\)-skew graphs with applications (Q2025257) (← links)
- A note on the crossing number of the cone of a graph (Q2053697) (← links)
- On the skewness of Cartesian products with trees (Q2322877) (← links)
- Planarization and fragmentability of some classes of graphs (Q2427499) (← links)
- On the skewness of the join of graphs (Q2444532) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Heuristics for the maximum outerplanar subgraph problem (Q2573002) (← links)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- Graph-Based Generation of Referring Expressions (Q3225398) (← links)
- An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method (Q3608305) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- Crossing numbers of Sierpiński‐like graphs (Q5711776) (← links)
- SPLITTING NUMBER is NP-complete (Q5928869) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
- On the skewness of products of graphs (Q6184338) (← links)