Planar graphs: Theory and algorithms
From MaRDI portal
Recommendations
Cited in
(84)- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Bipartite graphs, upward drawings, and planarity
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid
- Data Structures and their Planar Graph Layouts
- A left-first search algorithm for planar graphs
- The approximation of maximum subgraph problems
- Planarizing graphs and their drawings by vertex splitting
- Incremental convex planarity testing
- Asymptotic dimension of planes and planar graphs
- The theorem on planar graphs
- Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
- The growth and form of tunnelling networks in ants
- A modular approach to Sprouts
- Heuristic for rapidly four-coloring large planar graphs
- Uniqueness of equilibria in atomic splittable polymatroid congestion games
- On planar perfectly contractile graphs
- Concurrence and three-tangle of the graph
- A strengthened analysis of an algorithm for dominating set in planar graphs
- The entire coloring of series-parallel graphs
- On the approximation of protein threading
- PLANAR GRAPHS AND RELATED TOPICS
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract)
- Building a maximal independent set for the vertex-coloring problem on planar graphs
- Hamiltonicity and colorings of arrangement graphs
- Simpler linear-time kernelization for planar dominating set
- scientific article; zbMATH DE number 6000734 (Why is no real title available?)
- scientific article; zbMATH DE number 4189751 (Why is no real title available?)
- Convex representations of maps on the torus and other flat surfaces
- scientific article; zbMATH DE number 2185702 (Why is no real title available?)
- Does contraction preserve triangular meshes?
- Orthogonal drawings based on the stratification of planar graphs
- Divider-based algorithms for hierarchical tree partitioning.
- A heuristic for the coloring of planar graphs
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
- Approximation algorithms for NP-complete problems on planar graphs
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- At most single-bend embeddings of cubic graphs
- Flow in planar graphs with vertex capacities
- Edge-Intersection Graphs of k-Bend Paths in Grids
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Planarity for clustered graphs
- Rectangular grid drawings of plane graphs
- On almost-planar graphs
- Triangle graphs
- Planar graphs, Hamilton cycles and extreme independence number
- List total colorings of series-parallel graphs
- Each maximal planar graph with exactly two separating triangles is Hamiltonian
- Cliques and extended triangles. A necessary condition for planar clique graphs
- An algorithm for the characterization of the nonplanarity of a maximal graphical partition
- Orthogonal planarity testing of bounded treewidth graphs
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
- Monotone drawings of graphs with fixed embedding
- Planarization of graphs embedded on surfaces
- Small grid drawings of planar graphs with balanced partition
- Parallel approximation schemes for problems on planar graphs
- Upward drawings of triconnected digraphs.
- Classes of cycle bases
- Dynamic programming algorithms for RNA secondary structure prediction with pseudoknots
- scientific article; zbMATH DE number 951476 (Why is no real title available?)
- Faster computation of the Robinson-Foulds distance between phylogenetic networks
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS
- Maximum flow in directed planar graphs with vertex capacities
- Simple planar graph partition into three forests
- Drawing \(c\)-planar biconnected clustered graphs
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- How to draw a series-parallel digraph
- On-line convex planarity testing
- Rectangular grid drawings of plane graphs
- Algorithms for 1-Planar Graphs
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Multiple point visibility and related problems
- scientific article; zbMATH DE number 3896936 (Why is no real title available?)
- A parallel algorithm for edge-coloring partial k-trees
- Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces
- Separating translates in the plane: Combinatorial bounds and an algorithm
- Computing orthogonal drawings with the minimum number of bends
- Algorithms for finding f-colorings of partial k-trees
- Clique planar graphs
- Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Transit sets of two-point crossover
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
- scientific article; zbMATH DE number 4079189 (Why is no real title available?)
This page was built for publication: Planar graphs: Theory and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210706)
