Image de couverture de livre

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goetze, Miriam, Jungeblut, Paul, Ueckerdt, Torsten
Format:	Preprint
Publié:	2024
Sujets:	Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
par: Goetze, Miriam, et autres
Publié: (2025)

Directed Acyclic Outerplanar Graphs Have Constant Stack Number
par: Jungeblut, Paul, et autres
Publié: (2022)

Boundedness and Separation in the Graph Covering Number Framework
par: Goetze, Miriam, et autres
Publié: (2025)

Cops and Robber -- When Capturing is not Surrounding
par: Jungeblut, Paul, et autres
Publié: (2023)

Primal-Dual Cops and Robber
par: Ha, Minh Tuan, et autres
Publié: (2023)

Number of Edges in 3-Connected Graphs with Cyclic Neighborhoods
par: Schneider, Samuel, et autres
Publié: (2025)

Partitioning a Planar Graph into two Triangle-Forests
par: Knauer, Kolja, et autres
Publié: (2024)

A Note on Polychromatic Colorings of Shift-Chains
par: Ueckerdt, Torsten
Publié: (2024)

On 3-Connected Cubic Planar Graphs and their Strong Embeddings on Orientable Surfaces
par: Weiß, Meike, et autres
Publié: (2025)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
par: D'Elia, Marco, et autres
Publié: (2024)

Edge densities of drawings of graphs with one forbidden cell
par: Hahn, Benedikt, et autres
Publié: (2025)

Treewidth of Outer $k$-Planar Graphs
par: Pyzik, Rafał
Publié: (2025)

Intersection Graphs with and without Product Structure
par: Merker, Laura, et autres
Publié: (2024)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
par: Weiß, Meike, et autres
Publié: (2026)

Odd coloring graphs with linear neighborhood complexity
par: Davies, James, et autres
Publié: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

$k$-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for $k \geq 5$
par: la Tour, Max Dupré, et autres
Publié: (2024)

On Large Induced Outerplanar Subgraphs in $2$-Outerplanar Graphs
par: D'Elia, Marco, et autres
Publié: (2026)

3-Colouring Planar Graphs
par: Dujmović, Vida, et autres
Publié: (2025)

Forbidden Induced Subgraph Characterization of Word-Representable Split Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
par: Lozin, Vadim, et autres
Publié: (2022)

Flipping Non-Crossing Spanning Trees
par: Bjerkevik, Håvard Bakke, et autres
Publié: (2024)

Partitioning Complete Geometric Graphs on Dense Point Sets into Plane Subgraphs
par: Dumitrescu, Adrian, et autres
Publié: (2024)

Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2025)

Note on Min-k-Planar Drawings of Graphs
par: Hliněný, Petr, et autres
Publié: (2024)

On 1-Planar Graphs with Bounded Cop-Number
par: Bose, Prosenjit, et autres
Publié: (2024)

Face-hitting Dominating Sets in Planar Graphs
par: Francis, P., et autres
Publié: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
par: Distel, Marc, et autres
Publié: (2024)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
par: Büngener, Aaron
Publié: (2025)

Graph Reconstruction with Connectivity Queries
par: Kluk, Kacper, et autres
Publié: (2024)

Structural Origins of Cubic Complexity in Pebble Motion
par: Nakamigawa, Tomoki, et autres
Publié: (2025)

On $k$-planar Graphs without Short Cycles
par: Bekos, Michael A., et autres
Publié: (2024)

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials
par: Ai, Jiangdong, et autres
Publié: (2024)

On $(k,g)$-Graphs without $(g+1)$-Cycles
par: Eze, Leonard Chidiebere, et autres
Publié: (2024)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
par: Bharadwaj, et autres
Publié: (2025)

Maximum Eccentric Connectivity Index for Graphs with Given Diameter
par: Hauweele, Pierre, et autres
Publié: (2018)

Planar cycle-extendable graphs
par: Dalwadi, Aditya Y, et autres
Publié: (2024)

Planar graphs in blowups of fans
par: Distel, Marc, et autres
Publié: (2024)