Characterizations of outerplanar graphs
From MaRDI portal
Cites work
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- scientific article; zbMATH DE number 3668666 (Why is no real title available?)
- scientific article; zbMATH DE number 3717354 (Why is no real title available?)
- scientific article; zbMATH DE number 15378 (Why is no real title available?)
- scientific article; zbMATH DE number 3508539 (Why is no real title available?)
- scientific article; zbMATH DE number 3547322 (Why is no real title available?)
- scientific article; zbMATH DE number 3614802 (Why is no real title available?)
- scientific article; zbMATH DE number 3619927 (Why is no real title available?)
- scientific article; zbMATH DE number 3639680 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- On Algorithms for Enumerating All Circuits of a Graph
- On cycle bases of a graph
- On the depth of a planar graph
- Parallel concepts in graph theory
Cited in
(64)- A note on fundamental, non-fundamental, and robust cycle bases
- Adjoints of binary matroids
- On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines
- A partial k-arboretum of graphs with bounded treewidth
- Hamiltonicity in locally finite graphs: two extensions and a counterexample
- Linear-time recognition of map graphs with outerplanar witness
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- The distance orientation problem
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- 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
- Many faces of symmetric edge polytopes
- On 3-pushdown graphs with large separators
- Applying clique-decomposition for computing Gromov hyperbolicity
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- The maximum \(k\)-differential coloring problem
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs
- A note on domination number in maximal outerplanar graphs
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
- Embedding Outerplanar Graphs in Small Books
- Patterns in Khovanov link and chromatic graph homology
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Graphs with total forcing number two, revisited
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition
- Schematic representation of large biconnected graphs
- Schematic Representation of Biconnected Graphs
- On the genus of non-zero component union graphs of vector spaces
- An improved fixed-parameter algorithm for one-page crossing minimization
- Total domination in maximal outerplanar graphs
- Designing networks with good equilibria under uncertainty
- Every outer-1-plane graph has a right angle crossing drawing
- The prime ideals intersection graph of a ring
- Minimum size tree-decompositions
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- On the basic properties of the compressed annihilator graph of \(\mathbb{Z}_n\)
- 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
- Path eccentricity of graphs
- Minimum spanning tree cycle intersection problem on outerplanar graphs
- An improved algorithm for finding maximum outerplanar subgraphs
- On the size of minimal separators for treedepth decomposition
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Lasserre hierarchy for graph isomorphism and homomorphism indistinguishability
- Leanness computation: small values and special graph classes
- Approximate realizations for outerplanaric degree sequences
- Space-efficient biconnected components and recognition of outerplanar graphs
- Degree realization by bipartite cactus graphs
- Outer connected fuzzy resolving set and its application on pipeline connection
- Exploring the influence of graph operations on zero forcing sets
- Computing Hamiltonian paths with partial order restrictions
- k-shortest simple paths in bounded treewidth graphs
- Approximate realizations for outerplanaric degree sequences
- On key parameters affecting the realizability of degree sequences (invited paper)
- The rainbow number of cycles in maximal outerplanar graphs
- Separability of witness Gabriel drawings
- Degree realization by bipartite cactus graphs
- 2-connecting outerplanar graphs without blowing up the pathwidth
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties
- Simultaneous graph embedding with bends and circular arcs
This page was built for publication: Characterizations of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1255015)
