Pages that link to "Item:Q1210706"
From MaRDI portal
The following pages link to Planar graphs: Theory and algorithms (Q1210706):
Displaying 28 items.
- Multiple point visibility and related problems (Q2710754) (← links)
- Clique planar graphs (Q2741486) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- (Q3024892) (← links)
- (Q3110075) (← links)
- Approximation algorithms for NP-complete problems on planar graphs (Q4299299) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- The approximation of maximum subgraph problems (Q4630247) (← links)
- Data Structures and their Planar Graph Layouts (Q4637665) (← links)
- Algorithms for 1-Planar Graphs (Q5001657) (← links)
- Asymptotic dimension of planes and planar graphs (Q5047910) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- How to draw a series-parallel digraph (Q5056147) (← links)
- Separating translates in the plane: Combinatorial bounds and an algorithm (Q5056170) (← links)
- Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract) (Q5060109) (← links)
- Computing orthogonal drawings with the minimum number of bends (Q5096950) (← links)
- Transit sets of two-point crossover (Q5151499) (← links)
- Edge-Intersection Graphs of k-Bend Paths in Grids (Q5323053) (← links)
- PLANAR GRAPHS AND RELATED TOPICS (Q5345637) (← links)
- ON EMBEDDING A GRAPH ON TWO SETS OF POINTS (Q5493895) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
- Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time (Q6053468) (← links)
- Planarity for clustered graphs (Q6102302) (← links)
- Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs (Q6120282) (← links)
- Rectangular grid drawings of plane graphs (Q6142896) (← links)
- Planarizing graphs and their drawings by vertex splitting (Q6172199) (← links)
- Algorithms for finding f-colorings of partial k-trees (Q6487980) (← links)
- Geometric thickness of multigraphs is \(\exists \mathbb{R} \)-complete (Q6547943) (← links)
