Imagen de Portada

Flips and Merge-Width in Sparse Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Drabik, Karolina, Dumas, Maël, Mählmann, Nikolas, Przybyszewski, Wojciech, Toruńczyk, Szymon
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Variants of Merge-Width and Applications
por: Drabik, Karolina, et al.
Publicado: (2026)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
por: Dreier, Jan, et al.
Publicado: (2024)

Separability Properties of Monadically Dependent Graph Classes
por: Bonnet, Édouard, et al.
Publicado: (2025)

Flipper games for monadically stable graph classes
por: Gajarský, Jakub, et al.
Publicado: (2023)

Existential Positive Transductions of Sparse Graphs
por: Mählmann, Nikolas, et al.
Publicado: (2026)

Merge-width and First-Order Model Checking
por: Dreier, Jan, et al.
Publicado: (2025)

Flip-width: Cops and Robber on dense graphs
por: Toruńczyk, Szymon
Publicado: (2023)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
por: Mählmann, Nikolas
Publicado: (2025)

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

Comparing Width Parameters on Graph Classes
por: Brettell, Nick, et al.
Publicado: (2023)

First-order transducibility among classes of sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2025)

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

Flips in colorful triangulations
por: Acharya, Rohan, et al.
Publicado: (2024)

On Modular Edge Colourings of Graphs
por: Berthe, Gaétan, et al.
Publicado: (2025)

Flipping and Forking
por: Przybyszewski, Wojciech, et al.
Publicado: (2025)

Cube Height, Cube Width and Related Extremal Problems for Posets
por: Bastide, Paul, et al.
Publicado: (2025)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)

Induced Minor Models. II. Sufficient conditions for polynomial-time detection of induced minors
por: Dallard, Clément, et al.
Publicado: (2024)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
por: Botler, F., et al.
Publicado: (2024)

Accelerated Cops and Robbers
por: Kinnersley, William B., et al.
Publicado: (2025)

Sparse String Graphs and Region Intersection Graphs over Minor-Closed Classes have Linear Expansion
por: Karol, Nikolai, et al.
Publicado: (2026)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Elementary first-order model checking for sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2024)

First-Order Logic and Twin-Width for Some Geometric Graphs
por: Geniet, Colin, et al.
Publicado: (2025)

Erdős-Pósa property of tripods in directed graphs
por: Briański, Marcin, et al.
Publicado: (2024)

On the edge expansion of random polytopes
por: Ferber, Asaf, et al.
Publicado: (2025)

Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Flipping Non-Crossing Spanning Trees
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)

Almost Perfect Mutually Unbiased Bases that are Sparse
por: Kumar, Ajeet, et al.
Publicado: (2024)

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

Graph Theory
por: Gilbert, Jesse D.
Publicado: (2011)

A Characterization of Geodetic Graphs in Terms of their Embedded Even Graphs
por: Frasser, Carlos E.
Publicado: (2026)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs
por: Cao, Yixin, et al.
Publicado: (2024)

On Threshold Compatibility Graphs
por: Hakim, Sheikh Azizul, et al.
Publicado: (2026)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
por: Mozhui, Khyodeno, et al.
Publicado: (2025)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
por: Neuen, Daniel, et al.
Publicado: (2026)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
por: Fuchser, Janne, et al.
Publicado: (2025)

Word-Representation of Melon Graphs
por: Mozhui, Khyodeno, et al.
Publicado: (2026)

Enumerating Two-Orbit Graphs
por: Seka, David, et al.
Publicado: (2026)

Word-Representability of Shift Graphs
por: Roy, Suchanda, et al.
Publicado: (2026)