Cover Image

Beyond Outerplanarity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chaplick, Steven, Kryven, Myroslav, Liotta, Giuseppe, Löffler, Andre, Wolff, Alexander
Format:	Preprint
Published:	2017
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Outerplanar and Forest Storyplans
by: Fiala, Jiří, et al.
Published: (2023)

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
by: D'Elia, Marco, et al.
Published: (2026)

Supports for Outerplanar and Bounded Treewidth Graphs
by: Raman, Rajiv, et al.
Published: (2025)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
by: Jungeblut, Paul, et al.
Published: (2022)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
by: D'Elia, Marco, et al.
Published: (2024)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
by: Araki, Toru
Published: (2026)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
by: Bekos, Michael A., et al.
Published: (2025)

Beyond recognizing well-covered graphs
by: Feghali, Carl, et al.
Published: (2024)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

Generation of Cycle Permutation Graphs and Permutation Snarks
by: Goedgebeur, Jan, et al.
Published: (2024)

On the existence of factors intersecting sets of cycles in regular graphs
by: Goedgebeur, Jan, et al.
Published: (2024)

An Efficient Genus Algorithm Based on Graph Rotations
by: Metzger, Alexander, et al.
Published: (2024)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

On Edge-Disjoint Maximal Outerplanar Graphs
by: Okada, Yuto, et al.
Published: (2026)

The only Class 0 Flower snark is the smallest
by: Bridi, Guilherme Adamatti, et al.
Published: (2025)

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes
by: Tiskin, Alexander
Published: (2022)

Secure Total Domination Number in Maximal Outerplanar Graphs
by: Aita, Yasufumi, et al.
Published: (2024)

A Lower bound for Secure Domination Number of an Outerplanar Graph
by: Araki, Toru
Published: (2024)

Shotgun assembly of random graphs
by: Johnston, Tom, et al.
Published: (2022)

Packing Topological Minors Half-Integrally
by: Liu, Chun-Hung
Published: (2017)

A generalization of Arc-Kayles
by: Dailly, Antoine, et al.
Published: (2017)

Asynchronous dynamics of isomorphic Boolean networks
by: Bridoux, Florian, et al.
Published: (2024)

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
by: Bastida, Sam, et al.
Published: (2026)

HIST-Critical Graphs and Malkevitch's Conjecture
by: Goedgebeur, Jan, et al.
Published: (2024)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

On graphs with a simple structure of maximal cliques
by: Gollin, J. Pascal, et al.
Published: (2025)

Determining a graph from its reconfiguration graph
by: Berthe, Gaétan, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Induced Minors and Region Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2025)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)

An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)

Self-Orthogonal Cellular Automata
by: Mariot, Luca, et al.
Published: (2025)

Progress on Self Identifying Codes
by: Jean, Devin, et al.
Published: (2025)

Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings
by: Dailly, Antoine, et al.
Published: (2025)

Accelerated Cops and Robbers
by: Kinnersley, William B., et al.
Published: (2025)

Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)

Faces in rectilinear drawings of complete graphs
by: Balko, Martin, et al.
Published: (2025)

4-tangrams are 4-avoidable
by: Ochem, Pascal, et al.
Published: (2025)

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)