:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chuet, Quentin, Dai, Tianjiao, Ouyang, Qiancheng, Pirot, François
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	https://arxiv.org/abs/2505.04543
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Acyclic colourings of graphs with obstructions
by: Chuet, Quentin, et al.
Published: (2022)

Fractional domatic number and minimum degree
by: Chuet, Quentin, et al.
Published: (2025)

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

New Bounds for Proper h‐Conflict‐Free Colorings
by: Quentin Chuet, et al.
Published: (2026)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
by: Nakajima, Tamio-Vesa, et al.
Published: (2025)

Boundedness for proper conflict-free and odd colorings
by: Jiménez, Andrea, et al.
Published: (2023)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
by: Aboulker, Pierre, et al.
Published: (2024)

Independent transversal blow-up of graphs
by: Dai, Tianjiao, et al.
Published: (2025)

Proper conflict-free choosability of planar graphs
by: Wang, Yuting, et al.
Published: (2025)

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

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)

Star colouring and locally constrained graph homomorphisms
by: Antony, Cyriac, et al.
Published: (2023)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

Faster 3-colouring algorithm for graphs of diameter 3
by: Groenland, Carla, et al.
Published: (2026)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
by: Beaudou, Laurent, et al.
Published: (2021)

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
by: Falgas-Ravry, Victor, et al.
Published: (2022)

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
by: Claus, Quentin, et al.
Published: (2026)

Trees with proper thinness 2
by: Bonomo-Braberman, Flavia, et al.
Published: (2025)

Inversion diameter and 2-edge-colored homomorphisms
by: Arana, Carmen, et al.
Published: (2026)

Excluding an apex-forest or a fan as quickly as possible
by: Claus, Quentin, et al.
Published: (2026)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
by: Gutin, Gregory, et al.
Published: (2024)

Clustered independence and bounded treewidth
by: Knauer, Kolja, et al.
Published: (2023)

The sandwich problem for odd-hole-free and even-hole-free graphs
by: Cameron, Kathie, et al.
Published: (2024)

An explicit condition for boundedly supermultiplicative subshifts
by: Bui, Vuong, et al.
Published: (2024)

An improvement on the bound for the acyclic chromatic index
by: Kirousis, Lefteris, et al.
Published: (2026)

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

Approximating maximum-size properly colored forests
by: Bai, Yuhang, et al.
Published: (2024)

Weakly toll convexity and proper interval graphs
by: Dourado, Mitre C., et al.
Published: (2022)

Clique-free t-matchings in degree-bounded graphs
by: Paluch, Katarzyna, et al.
Published: (2024)

Token positional games
by: Bagan, Guillaume, et al.
Published: (2026)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

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

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

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

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

Tight bound for the Erdős-Pósa property of tree minors
by: Dujmović, Vida, et al.
Published: (2024)