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