Imagen de Portada

Bounding Width on Graph Classes of Constant Diameter

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Dabrowski, Konrad K., Eagling-Vose, Tala, Köhler, Noleen, Ordyniak, Sebastian, Paulusma, Daniël
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
por: Lucke, Felicia, et al.
Publicado: (2024)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

Twin-width one
por: Ahn, Jungho, et al.
Publicado: (2025)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
por: Beisegel, Jesse, et al.
Publicado: (2025)

The Complexity of Diameter on H-free graphs
por: Oostveen, Jelle J., et al.
Publicado: (2024)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

On Detecting $H$-Induced Minors for Small $H$
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

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

The Simultaneous Interval Number: A New Width Parameter that Measures the Similarity to Interval Graphs
por: Beisegel, Jesse, et al.
Publicado: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
por: Beisegel, Jesse, et al.
Publicado: (2025)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
por: Neuen, Daniel
Publicado: (2020)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

An Improved Bound for the Beck-Fiala Conjecture
por: Bansal, Nikhil, et al.
Publicado: (2025)

Tight Bounds for Sparsifying Random CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2025)

Greedy Gray Codes for some Restricted Classes of Binary Words
por: Hassler, Nathanaël, et al.
Publicado: (2024)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

Finding d-Cuts in Claw-free Graphs
por: Ahn, Jungho, et al.
Publicado: (2025)

Circulant TSP: Vertices of the Edge-Length Polytope and Superpolynomial Lower Bounds
por: Gutekunst, Samuel C.
Publicado: (2025)

EPTAS for Hard Graph Cut Problems for Dense Graphs
por: Deguchi, Kaisei, et al.
Publicado: (2026)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
por: Charbit, Pierre, et al.
Publicado: (2025)

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
por: Beisegel, Jesse, et al.
Publicado: (2025)

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Palette Sparsification for Graphs with Sparse Neighborhoods
por: Dhawan, Abhishek
Publicado: (2024)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

Hardness of Burning Number Problem on Regular Graphs
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)