Cover Image

Twin-width of graphs on surfaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kráľ, Daniel, Pekárková, Kristýna, Štorgel, Kenny
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Branch-depth is minor closure of contraction-deletion-depth
by: Briański, Marcin, et al.
Published: (2024)

Obstructions and dualities for matroid depth parameters
by: Gajarský, Jakub, et al.
Published: (2025)

Measuring Depth of Matroids
by: Balabán, Jakub, et al.
Published: (2026)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Closure property of contraction-depth of matroids
by: Brianski, Marcin, et al.
Published: (2023)

Functionality of box intersection graphs
by: Dallard, Clément, et al.
Published: (2023)

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

Twin-width of random graphs
by: Ahn, Jungho, et al.
Published: (2022)

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

Contact graphs of boxes with unidirectional contacts
by: Gonçalves, Daniel, et al.
Published: (2023)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
by: Beaudou, Laurent, et al.
Published: (2025)

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

The treewidth and pathwidth of graph unions
by: Alecu, Bogdan, et al.
Published: (2022)

3-colorable planar graphs have an intersection segment representation using 3 slopes
by: Gonçalves, Daniel
Published: (2025)

Playing Sudoku on random 3-regular graphs
by: Dippel, Jack, et al.
Published: (2025)

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
by: Chakraborty, Dibyayan
Published: (2025)

Biclique immersions in graphs with independence number 2
by: Botler, Fábio, et al.
Published: (2023)

Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)

On universal graphs for trees and treewidth $k$ graphs
by: Kaul, Neel, et al.
Published: (2025)

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

Vertex-critical graphs in co-gem-free graphs
by: Beaton, Iain, et al.
Published: (2024)

Effects of graph operations on star pairwise compatibility graphs
by: Monti, Angelo, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

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

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs
by: Lozin, Vadim, et al.
Published: (2022)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

Diameter of the inversion graph
by: Havet, Frédéric, et al.
Published: (2024)

Colouring t-perfect graphs
by: Chudnovsky, Maria, et al.
Published: (2024)

Contractions in perfect graph
by: Dupont-Bouillard, Alexandre, et al.
Published: (2024)

On total transitivity of graphs
by: Santra, Kamal
Published: (2025)

Linear colorings of graphs
by: Hilaire, Claire, et al.
Published: (2025)

Path eccentricity of $k$-AT-free graphs and application on graphs with the consecutive ones property
by: Bastide, Paul, et al.
Published: (2024)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
by: Tian, Ting, et al.
Published: (2025)

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)

On approximating the rank of graph divisors
by: Bérczi, Kristóf, et al.
Published: (2022)