Cover Image

Bounds on the Twin-Width of Product Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pettersson, William, Sylvester, John
Format:	Preprint
Published:	2022
Subjects:	Combinatorics Discrete Mathematics 05C99, 68R10 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Polynomial Bounds for the Graph Minor Structure Theorem
by: Gorsky, Maximilian, et al.
Published: (2025)

Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Tangled Paths: A Random Graph Model from Mallows Permutations
by: Enright, Jessica, et al.
Published: (2021)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

The Local Structure Theorem for Graph Minors with finite index
by: Paul, Christophe, et al.
Published: (2025)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Thick Forests
by: Dyer, Martin, et al.
Published: (2023)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces
by: Paul, Christophe, et al.
Published: (2024)

On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)

Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic
by: Loth, Jesse Campion, et al.
Published: (2022)

m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)

A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)

The Minimum Eternal Vertex Cover Problem on a Subclass of Series-Parallel Graphs
by: Calamoneri, Tiziana, et al.
Published: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

A coarse Menger's Theorem for planar and bounded genus graphs
by: Blažej, Václav, et al.
Published: (2026)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)

Small But Unwieldy: A Lower Bound on Adjacency Labels for Small Classes
by: Bonnet, Édouard, et al.
Published: (2023)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)