Imagen de Portada

Comparing Width Parameters on Graph Classes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Brettell, Nick, Munaro, Andrea, Paulusma, Daniël, Yang, Shizhou
Formato:	Preprint
Publicado:	2023
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

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

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

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

A Brooks-type theorem for the k-choosability of graphs with maximum local edge-connectivity k
por: Bastida, Sam, et al.
Publicado: (2026)

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

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
por: Munaro, Andrea, et al.
Publicado: (2022)

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

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

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

Non-empty intersection of longest paths in $H$-free graphs
por: Long Jr., James A., et al.
Publicado: (2023)

Sublinear Longest Path Transversals
por: Long Jr., James A., et al.
Publicado: (2020)

Clique-Width: Harnessing the Power of Atoms
por: Dabrowski, Konrad K., et al.
Publicado: (2020)

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

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

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

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

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

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

Structural Parameters for Dense Temporal Graphs
por: Enright, Jessica, et al.
Publicado: (2024)

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

Characterization of Split Comparability Graphs
por: Dwary, Tithi, et al.
Publicado: (2025)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

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

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

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

Layered tree-independence number and clique-based separators
por: Dallard, Clément, et al.
Publicado: (2025)

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

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

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

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

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

The only Class 0 Flower snark is the smallest
por: Bridi, Guilherme Adamatti, et al.
Publicado: (2025)

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

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

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

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
por: Bourneuf, Romain, et al.
Publicado: (2025)

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

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)