Cover Image

Supports for Outerplanar and Bounded Treewidth Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Raman, Rajiv, Singh, Karamjeet
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Hypergraph Supports
by: Raman, Rajiv, et al.
Published: (2023)

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

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

Beyond Outerplanarity
by: Chaplick, Steven, et al.
Published: (2017)

Optimal Tree-Decompositions with Bags of Bounded Treewidth
by: Hendrey, Kevin, et al.
Published: (2025)

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

Treewidth of Outer $k$-Planar Graphs
by: Pyzik, Rafał
Published: (2025)

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

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Separation Number and Treewidth, Revisited
by: Houdrouge, Hussein, et al.
Published: (2025)

Product Structure and Treewidth of Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2026)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
by: Gerke, Stefanie, et al.
Published: (2024)

Lower Bounds for Induced-Universal Graphs
by: Gavoille, Cyril, et al.
Published: (2025)

Bounds on the Complete Forcing Number of Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)

Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
by: Bhyravarapu, Sriram, et al.
Published: (2021)

On 1-Planar Graphs with Bounded Cop-Number
by: Bose, Prosenjit, et al.
Published: (2024)

String Graph Obstacles of High Girth and of Bounded Degree
by: Chudnovsky, Maria, et al.
Published: (2025)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
by: Dvořák, Pavel, et al.
Published: (2023)

Every Graph is Essential to Large Treewidth
by: Alecu, Bogdan, et al.
Published: (2025)

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

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

Lower Bounds for Maximum Weighted Cut
by: Gutin, Gregory, et al.
Published: (2021)

Bounds on treewidth via excluding disjoint unions of cycles
by: Hatzel, Meike, et al.
Published: (2025)

Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)

On the Gap between Hereditary Discrepancy and the Determinant Lower Bound
by: Li, Lily, et al.
Published: (2023)

Upper Bounds on the Average Height of Random Binary Trees
by: Benkner, Louisa Seelbach
Published: (2024)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

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

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
by: Beisegel, Jesse, et al.
Published: (2025)

An Algorithmic Upper Bound for Permanents via a Permanental Schur Inequality
by: Laddha, Aditi, et al.
Published: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

Asymptotic Tightness of the Pigeonhole Bound for Large-Order Davenport-Schinzel Sequences
by: Geneson, Jesse
Published: (2026)

Characterization of Circular-arc Graphs: III. Chordal Graphs
by: Cao, Yixin, et al.
Published: (2024)