Cover Image

On cuts of small chromatic number in sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aubian, Guillaume, Bonamy, Marthe, Bourneuf, Romain, Fontaine, Oscar, Picasarri-Arrieta, Lucas
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dichromatic number of chordal graphs
by: Bessy, Stéphane, et al.
Published: (2023)

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)

On the minimum number of arcs in $4$-dicritical oriented graphs
by: Havet, Frédéric, et al.
Published: (2023)

Acyclic dichromatic number of oriented graphs
by: Bang-Jensen, Jørgen, et al.
Published: (2025)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

Minimum number of arcs in $k$-critical digraphs with order at most $2k-1$
by: Picasarri-Arrieta, Lucas, et al.
Published: (2023)

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

(Claw, C_3)-free digraphs with unbounded dichromatic number
by: Aubian, Guillaume, et al.
Published: (2026)

Backbone colouring of chordal graphs
by: Araújo, Júlio, et al.
Published: (2025)

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

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

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

Generalized DP-colorings of digraphs
by: Picasarri-Arrieta, Lucas, et al.
Published: (2025)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
by: Hörsch, Florian, et al.
Published: (2024)

Increasing arc-connectivity by bounded- and fixed-size inversions
by: Hörsch, Florian, et al.
Published: (2026)

Subdivisions in dicritical digraphs with large order or digirth
by: Picasarri-Arrieta, Lucas, et al.
Published: (2024)

An analogue of Reed's conjecture for digraphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

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

Redicolouring digraphs: directed treewidth and cycle-degeneracy
by: Nisse, Nicolas, et al.
Published: (2023)

Constrained Flows in Networks
by: Bessy, Stéphane, et al.
Published: (2023)

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

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

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

More results on the $z$-chromatic number of graphs
by: Khaleghi, Abbas, et al.
Published: (2023)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
by: Bourneuf, Romain, et al.
Published: (2025)

$(Δ-1)$-dicolouring of digraphs
by: Harutyunyan, Ararat, et al.
Published: (2025)

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

Making Graphs Irregular through Irregularising Walks
by: Bensmail, Julien, et al.
Published: (2025)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
by: Bourneuf, Romain, et al.
Published: (2026)

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

The chromatic number of triangle-free hypergraphs
by: Li, Lina, et al.
Published: (2022)

Linear versus centred chromatic numbers
by: Bose, Prosenjit, et al.
Published: (2022)

Burling graphs in graphs with large chromatic number
by: Abrishami, Tara, et al.
Published: (2025)

Circular chromatic index of small graphs
by: Mazák, Ján, et al.
Published: (2026)

Balanced-chromatic number and Hadwiger-like conjectures
by: Jiménez, Andrea, et al.
Published: (2023)

The strong chromatic index of $K_{t,t}$-free graphs
by: Bi, Richard, et al.
Published: (2026)

Bounding the chromatic number of dense digraphs by arc neighborhoods
by: Klingelhoefer, Felix, et al.
Published: (2023)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)