Linear algorithms to recognize outerplanar and maximal outerplanar graphs
From MaRDI portal
Cites work
Cited in
(50)- The subgraph isomorphism problem for outerplanar graphs
- A linear-time algorithm for isomorphism of a subclass of chordal graphs
- Fast detection and display of symmetry in outerplanar graphs
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Naturally submodular digraphs and forbidden digraph configurations
- Maximum packing for biconnected outerplanar graphs
- Metric dimension of maximal outerplanar graphs
- The distance orientation problem
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
- Planar rectilinear drawings of outerplanar graphs in linear time
- A survey on book-embedding of planar graphs
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Conflict-free coloring bounds on open neighborhoods
- A connected version of the graph coloring game
- Bundled crossings revisited
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Two-page book embedding of trees under vertex-neighborhood constraints
- Polynomial-time algorithms for special cases of the maximum confluent flow problem
- A framework and algorithms for circular drawings of graphs
- Heuristics for the maximum outerplanar subgraph problem
- Maxregularity and maximal outerplanar graphs
- Outer 1-planar graphs
- Max point-tolerance graphs
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- The lexicographically first maximal subgraph problems:P-completeness andNC algorithms
- Testing outerplanarity of bounded degree graphs
- Schematic representation of large biconnected graphs
- Schematic Representation of Biconnected Graphs
- An improved fixed-parameter algorithm for one-page crossing minimization
- Bundled crossings revisited
- MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
- Graph classes and forbidden patterns on three vertices
- On Aligned Bar 1-Visibility Graphs
- A stronger lower bound on parametric minimum spanning trees
- Twisted ways to find plane structures in simple drawings of complete graphs
- Uniquely colorable graphs up to automorphisms
- An improved algorithm for finding maximum outerplanar subgraphs
- On the order dimension of outerplanar maps
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Space-efficient biconnected components and recognition of outerplanar graphs
- Pathlength of outerplanar graphs
- Spanning cactus and spanning cactus extension of outerplanar graphs
- Computing Hamiltonian paths with partial order restrictions
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- A stronger lower bound on parametric minimum spanning trees
- Area-efficient planar straight-line drawings of outerplanar graphs
- Simultaneous graph embedding with bends and circular arcs
- The Steiner forest problem revisited
This page was built for publication: Linear algorithms to recognize outerplanar and maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144938)
