scientific article
From MaRDI portal
Publication:2702747
zbMath0958.05033MaRDI QIDQ2702747
Bojan Mohar, Jože Marinček, Martin Juvan
Publication date: 13 March 2001
Full work available at URL: https://eudml.org/doc/34454
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Minors in large almost-5-connected non-planar graphs ⋮ Obstructions for two-vertex alternating embeddings of graphs in surfaces ⋮ The structure of graphs not topologically containing the Wagner graph ⋮ Flexibility of projective-planar embeddings ⋮ Some recent progress and applications in graph minor theory ⋮ Projective plan and Möbius band obstructions ⋮ Embedding graphs in the torus in linear time ⋮ Unnamed Item ⋮ Crossing number and weighted crossing number of near-planar graphs ⋮ 2-restricted extensions of partial embeddings of graphs ⋮ Crossing and Weighted Crossing Number of Near-Planar Graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ \(K_{a,k}\) minors in graphs of bounded tree-width
Cites Work
- A linear algorithm for embedding planar graphs using PQ-trees
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Convex representations of maps on the torus and other flat surfaces
- Time bounded random access machines
- Depth-First Search and Kuratowski Subgraphs
- Embedding Graphs in the Plane—Algorithmic Aspects
- A Depth-First-Search Characterization of Planarity
- Efficient Planarity Testing
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
