Cover Image

On the Biplanarity of Blowups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Eppstein, David
Format:	Preprint
Published:	2023
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Widths of Strict Outerconfluent Graphs
by: Eppstein, David
Published: (2023)

Hamiltonian Cycles in Subdivided Doubles
by: Eppstein, David
Published: (2025)

Set System Blowups
by: Alweiss, Ryan
Published: (2020)

Blowups of triangle-free graphs
by: Girão, António, et al.
Published: (2024)

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

On the expansion of Hanoi graphs
by: Eppstein, David, et al.
Published: (2025)

Graphs Excluding a Minor in Blowups of Treewidth 3 Graphs
by: Distel, Marc
Published: (2025)

Proper Minor-Closed Classes in Blowups of Fans
by: Distel, Marc
Published: (2024)

Three-dimensional graph products with unbounded stack-number
by: Eppstein, David, et al.
Published: (2022)

Blowup Algebras of $n$--dimensional Ferrers Diagrams
by: Lin, Kuei-Nuan, et al.
Published: (2025)

Product structure extension of the Alon--Seymour--Thomas theorem
by: Distel, Marc, et al.
Published: (2022)

Blowups in BPS/CFT correspondence, and Painlevé VI
by: Nekrasov, Nikita
Published: (2020)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
by: Eppstein, David
Published: (2023)

Stabbing Faces By a Convex Curve
by: Eppstein, David
Published: (2025)

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

Orthogonal dissection into few rectangles
by: Eppstein, David
Published: (2022)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
by: Eppstein, David
Published: (2025)

Computational Complexities of Folding
by: Eppstein, David
Published: (2024)

The Complexity of Iterated Reversible Computation
by: Eppstein, David
Published: (2021)

Enumerative Combinatorics of Homogeneous Linear Orderings
by: Gonzalez, David
Published: (2026)

On Some Algorithmic and Structural Results on Flames
by: Szeszlér, Dávid
Published: (2025)

On the perfect $k$-divisibility of graphs
by: Scholz, David
Published: (2025)

L-log-concavity and a proof of the conjecture of Lam, Postnikov and Pylyavskyy
by: Speyer, David E
Published: (2026)

Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
by: Hu, Sihuang, et al.
Published: (2025)

Domination inequalities and dominating graphs
by: Conlon, David, et al.
Published: (2023)

RSK linear operators and the Vershik-Kerov-Logan-Shepp curve
by: Phan, Duy, et al.
Published: (2025)

On graphs with unique geoodesics and antipodes
by: Gorovoy, Dmitriy, et al.
Published: (2021)

A Cambrian framework for the oriented cycle
by: Reading, Nathan, et al.
Published: (2015)

Colourings of path systems
by: Darijani, Iren, et al.
Published: (2022)

Colouring Strong Products
by: Esperet, Louis, et al.
Published: (2022)

Cambrian frameworks for cluster algebras of affine type
by: Reading, Nathan, et al.
Published: (2015)

A note on non-regular Bonnet-Myers Sharp Graphs
by: Cushing, David, et al.
Published: (2024)

Extremal numbers and Sidorenko's conjecture
by: Conlon, David, et al.
Published: (2023)

Slow graph bootstrap percolation II: Accelerating properties
by: Fabian, David, et al.
Published: (2023)

Slow graph bootstrap percolation I: Cycles
by: Fabian, David, et al.
Published: (2023)

$R(K_6-e, K_4) = 30$
by: James, David, et al.
Published: (2024)

Periods and atomic firing sequences of parallel chip-firing games on directed graphs
by: Ji, David, et al.
Published: (2024)

Two counterexamples to a conjecture about even cycles
by: Conlon, David, et al.
Published: (2026)

Clustered Coloring of Graphs with Bounded Layered Treewidth and Bounded Degree
by: Liu, Chun-Hung, et al.
Published: (2022)

Quasi-tree-partitions of graphs with an excluded subgraph
by: Liu, Chun-Hung, et al.
Published: (2024)