Characterizations of outerplanar graphs
From MaRDI portal
Publication:1255015
DOI10.1016/0012-365X(79)90060-8zbMath0401.05040OpenAlexW1969474097WikidataQ56235009 ScholiaQ56235009MaRDI QIDQ1255015
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(79)90060-8
Related Items (49)
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ Planar rectilinear drawings of outerplanar graphs in linear time ⋮ A survey on book-embedding of planar graphs ⋮ EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING ⋮ Planar straight-line realizations of 2-trees with prescribed edge lengths ⋮ Adjoints of binary matroids ⋮ On the genus of non-zero component union graphs of vector spaces ⋮ Many faces of symmetric edge polytopes ⋮ Hamiltonicity in locally finite graphs: two extensions and a counterexample ⋮ Linear-time recognition of map graphs with outerplanar witness ⋮ Applying clique-decomposition for computing Gromov hyperbolicity ⋮ A note on domination number in maximal outerplanar graphs ⋮ Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees ⋮ Embedding Outerplanar Graphs in Small Books ⋮ On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines ⋮ The maximum \(k\)-differential coloring problem ⋮ RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties ⋮ Outerplanar Turán numbers of cycles and paths ⋮ Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ On the general position numbers of maximal outerplane graphs ⋮ Untangling circular drawings: algorithms and complexity ⋮ The prime ideals intersection graph of a ring ⋮ Path eccentricity of graphs ⋮ Minimum spanning tree cycle intersection problem on outerplanar graphs ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Unnamed Item ⋮ The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ Space-efficient biconnected components and recognition of outerplanar graphs ⋮ A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree ⋮ Tree \(t\)-spanners in outerplanar graphs via supply demand partition ⋮ Minimum size tree-decompositions ⋮ Total domination in maximal outerplanar graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ On 3-pushdown graphs with large separators ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 ⋮ Unnamed Item ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ 2-connecting outerplanar graphs without blowing up the pathwidth ⋮ A note on fundamental, non-fundamental, and robust cycle bases ⋮ A partial k-arboretum of graphs with bounded treewidth ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design ⋮ Schematic Representation of Large Biconnected Graphs ⋮ The distance orientation problem ⋮ Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size ⋮ Schematic Representation of Biconnected Graphs ⋮ An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs
Cites Work
- On the depth of a planar graph
- Parallel concepts in graph theory
- On cycle bases of a graph
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- On Algorithms for Enumerating All Circuits of a Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizations of outerplanar graphs
