Imagen de Portada

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bonamy, Marthe, Geniet, Colin
Formato:	Preprint
Publicado:	2025
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)

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

Basis Number of Graphs Excluding Minors
por: Geniet, Colin, et al.
Publicado: (2026)

Bipartite Turán number of paths and other trees
por: Bonamy, Marthe, et al.
Publicado: (2025)

On graph classes with constant domination-packing ratio
por: Bonamy, Marthe, et al.
Publicado: (2025)

Flips and Merge-Width in Sparse Graphs
por: Drabik, Karolina, et al.
Publicado: (2026)

A Gray code for arborescences of tournaments
por: Bonamy, Marthe, et al.
Publicado: (2026)

On a recolouring version of Hadwiger's conjecture
por: Bonamy, Marthe, et al.
Publicado: (2021)

On cuts of small chromatic number in sparse graphs
por: Aubian, Guillaume, et al.
Publicado: (2025)

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

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

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

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

Boundedness and Separation in the Graph Covering Number Framework
por: Goetze, Miriam, et al.
Publicado: (2025)

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

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
por: Chekan, Vera, et al.
Publicado: (2024)

Transducing Linear Decompositions of Tournaments
por: Geniet, Colin, et al.
Publicado: (2026)

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

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
por: Geniet, Colin, et al.
Publicado: (2022)

Bounds on Path Energy of Graphs
por: Narke, Amol P., et al.
Publicado: (2022)

Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees
por: Gerke, Stefanie, et al.
Publicado: (2024)

Moderately beyond clique-width: reduced component max-leaf and related parameters
por: Bonnet, Édouard, et al.
Publicado: (2026)

Lower Bounds for Induced-Universal Graphs
por: Gavoille, Cyril, et al.
Publicado: (2025)

Supports for Outerplanar and Bounded Treewidth Graphs
por: Raman, Rajiv, et al.
Publicado: (2025)

Bounds on the Complete Forcing Number of Graphs
por: Ebrahimi, Javad B., et al.
Publicado: (2024)

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

On 1-Planar Graphs with Bounded Cop-Number
por: Bose, Prosenjit, et al.
Publicado: (2024)

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

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

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
por: Anto, Nevil, et al.
Publicado: (2023)

A Note on the Complexity of Graph Recoloring
por: Bousquet, Nicolas
Publicado: (2024)

Bounds on Functionality and Symmetric Difference -- Two Intriguing Graph Parameters
por: Dvořák, Pavel, et al.
Publicado: (2023)

Large Induced Subgraphs of Bounded Degree in Outerplanar and Planar Graphs
por: D'Elia, Marco, et al.
Publicado: (2024)

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
por: Dong, Sally, et al.
Publicado: (2023)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
por: Das, Sandip, et al.
Publicado: (2026)

Recognition Complexity of Subgraphs of k-Connected Planar Cubic Graphs
por: Goetze, Miriam, et al.
Publicado: (2024)

Complexity Issues Concerning the Quadruple Roman Domination Problem in Graphs
por: Palagiri, V. S. R., et al.
Publicado: (2024)

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs
por: Bok, Jan, et al.
Publicado: (2020)

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
por: Bonamy, Marthe, et al.
Publicado: (2020)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)