Linear algorithms to recognize outerplanar and maximal outerplanar graphs

Cites Work

A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
Efficient Planarity Testing
Parallel concepts in graph theory
Title not available (Why is that?)
An algorithm for testing chordality of graphs

Cited In (47)

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

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)