A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
From MaRDI portal
Publication:4255804
Recommendations
Cited in
(56)- A more accurate view of the flat wall theorem
- Embeddings of \(k\)-complexes into \(2k\)-manifolds
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- scientific article; zbMATH DE number 3995712 (Why is no real title available?)
- Embedding graphs into two-dimensional simplicial complexes
- Graph minor theory
- scientific article; zbMATH DE number 4142064 (Why is no real title available?)
- Six-Critical Graphs on the Klein Bottle
- A practical algorithm for the computation of the genus
- Five-coloring graphs on the Klein bottle
- A fast algorithm for the product structure of planar graphs
- Linear-Time Test for Small Face Covers in any Fixed Surface
- Approximating the Crossing Number of Toroidal Graphs
- On the upward embedding on the torus
- Projective plan and Möbius band obstructions
- The common structure of the curves having a same Gauss word
- A direct proof of the strong Hanani-Tutte theorem on the projective plane
- Approximation algorithms for Euler genus and related problems
- The crossing number of a projective graph is quadratic in the face–width
- Linkless and flat embeddings in 3-space
- Local search is a PTAS for feedback vertex set in minor-free graphs
- The birth and early years of parameterized complexity
- scientific article; zbMATH DE number 7662167 (Why is no real title available?)
- New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász
- Bundled crossings revisited
- Toroidal grid minors and stretch in embedded graphs
- Embedding of sign-regular signed graphs and its spectral analysis
- Some recent progress and applications in graph minor theory
- 2-restricted extensions of partial embeddings of graphs
- Deleting vertices to graphs of bounded genus
- Elimination of local bridges
- Stronger ILPs for the Graph Genus Problem.
- Graph minors and parameterized algorithm design
- scientific article; zbMATH DE number 2192203 (Why is no real title available?)
- Maximum cut parameterized by crossing number
- Algorithmic graph embeddings
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Embedding graphs in the torus in linear time
- Graphs whose complement and square are isomorphic
- Counting problems in parameterized complexity
- A basic parameterized complexity primer
- Dynamic programming for graphs on surfaces
- A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number
- scientific article; zbMATH DE number 7228873 (Why is no real title available?)
- Bundled crossings revisited
- The parameterized complexity of finding a 2-sphere in a simplicial complex
- Minimal disconnected cuts in planar graphs
- Approximation algorithms via contraction decomposition
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs
- Errors in graph embedding algorithms
- Properties of large 2-crossing-critical graphs
- Hanani-Tutte for approximating maps of graphs
This page was built for publication: A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255804)
