:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bonamy, Marthe, Bonnet, Édouard, Déprés, Hugues, Esperet, Louis, Geniet, Colin, Hilaire, Claire, Thomassé, Stéphan, Wesolek, Alexandra
Format:	Preprint
Published:	2022
Subjects:	Combinatorics Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2206.00594
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Maximum Independent Set when excluding an induced minor: $K_1 + tK_2$ and $tC_3 \uplus C_4$
by: Bonnet, Édouard, et al.
Published: (2023)

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

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

Faithful universal graphs for minor-closed classes
by: Bastide, Paul, et al.
Published: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, et al.
Published: (2025)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

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

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

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

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

Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
by: Chudnovsky, Maria, et al.
Published: (2024)

Characterization of sparse monotone graph classes with bounded domination-to-2-independence ratio
by: Bonamy, Marthe, et al.
Published: (2026)

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

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

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

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

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

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

Twin-width and permutations
by: Bonnet, Édouard, et al.
Published: (2021)

Infinite induced-saturated graphs
by: Bonamy, Marthe, et al.
Published: (2025)

Sparse Induced Subgraphs of Large Treewidth
by: Bonnet, Édouard
Published: (2024)

On the local resilience of random geometric graphs with respect to connectivity and long cycles
by: Díaz, Alberto Espuny, et al.
Published: (2024)

Coarse geometry of quasi-transitive graphs beyond planarity
by: Esperet, Louis, et al.
Published: (2023)

Complexity lower bounds for succinct binary structures of bounded clique-width with restrictions
by: Geniet, Colin, et al.
Published: (2026)

Graphs without a 3-connected subgraph are 4-colorable
by: Bonnet, Édouard, et al.
Published: (2024)

Antifactors in bipartite multigraphs
by: Esperet, Louis
Published: (2022)

Lollipops, dense cycles and chords
by: Dvořák, Zdeněk, et al.
Published: (2025)

Graphs that are quasi-isometric to graphs with bounded treewidth
by: Hickingbotham, Robert
Published: (2025)

List packing number of bounded degree graphs
by: Cambie, Stijn, et al.
Published: (2023)

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

Coarse cops and robber in graphs and groups
by: Esperet, Louis, et al.
Published: (2025)

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

Small hitting sets for longest paths and cycles
by: Norin, Sergey, et al.
Published: (2025)

Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs
by: Wang, Yichen, et al.
Published: (2026)

An alternative characterisation of graphs quasi-isometric to graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

An improved quasi-isometry between graphs of bounded cliquewidth and graphs of bounded treewidth
by: Distel, Marc
Published: (2025)

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

Induced Ramsey problems for trees and graphs with bounded treewidth
by: Hunter, Zach, et al.
Published: (2024)

The Leafed Induced Subtree in chordal and bounded treewidth graphs
by: Baste, Julien
Published: (2023)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)