Pages that link to "Item:Q1255015"
From MaRDI portal
The following pages link to Characterizations of outerplanar graphs (Q1255015):
Displaying 50 items.
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Total domination in maximal outerplanar graphs (Q516883) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- RNA structures with pseudo-knots: graph-theoretical, combinatorial, and statistical properties (Q886670) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- A note on fundamental, non-fundamental, and robust cycle bases (Q1026213) (← links)
- Adjoints of binary matroids (Q1109040) (← links)
- On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines (Q1122982) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Hamiltonicity in locally finite graphs: two extensions and a counterexample (Q1658750) (← links)
- Linear-time recognition of map graphs with outerplanar witness (Q1662161) (← links)
- A polynomial-time algorithm for computing the maximum common connected edge subgraph of outerplanar graphs of bounded degree (Q1736548) (← links)
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs (Q1786594) (← links)
- The distance orientation problem (Q2091816) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- An \(O( mn^2)\) algorithm for computing the strong geodetic number in outerplanar graphs (Q2118246) (← links)
- Planar rectilinear drawings of outerplanar graphs in linear time (Q2123284) (← links)
- A survey on book-embedding of planar graphs (Q2141323) (← links)
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- Many faces of symmetric edge polytopes (Q2161212) (← links)
- On 3-pushdown graphs with large separators (Q2277467) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128) (← links)
- A note on domination number in maximal outerplanar graphs (Q2659167) (← links)
- Embedding Outerplanar Graphs in Small Books (Q3749074) (← links)
- Patterns in Khovanov link and chromatic graph homology (Q4634896) (← links)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design (Q4727445) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- Schematic Representation of Large Biconnected Graphs (Q4994348) (← links)
- Schematic Representation of Biconnected Graphs (Q5014113) (← links)
- On the genus of non-zero component union graphs of vector spaces (Q5073767) (← links)
- (Q5111885) (← links)
- Designing Networks with Good Equilibria under Uncertainty (Q5232329) (← links)
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING (Q5300010) (← links)
- The prime ideals intersection graph of a ring (Q5357592) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
- (Q6046265) (← links)
- Outerplanar Turán numbers of cycles and paths (Q6056741) (← links)
- Rainbow subgraphs in edge-colored planar and outerplanar graphs (Q6063835) (← links)
- On the general position numbers of maximal outerplane graphs (Q6090821) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
- Path eccentricity of graphs (Q6162021) (← links)
- Minimum spanning tree cycle intersection problem on outerplanar graphs (Q6180692) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
- On the size of minimal separators for treedepth decomposition (Q6558688) (← links)
