Image de couverture de livre

New bounds for proper $h$-conflict-free colourings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chuet, Quentin, Dai, Tianjiao, Ouyang, Qiancheng, Pirot, François
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Acyclic colourings of graphs with obstructions
par: Chuet, Quentin, et autres
Publié: (2022)

Fractional domatic number and minimum degree
par: Chuet, Quentin, et autres
Publié: (2025)

Chromatic discrepancy of locally $s$-colourable graphs
par: Corsini, Timothée, et autres
Publié: (2025)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

New Bounds for Proper h‐Conflict‐Free Colorings
par: Quentin Chuet, et autres
Publié: (2026)

Independent transversal blow-up of graphs
par: Dai, Tianjiao, et autres
Publié: (2025)

Proper conflict-free choosability of planar graphs
par: Wang, Yuting, et autres
Publié: (2025)

Boundedness for proper conflict-free and odd colorings
par: Jiménez, Andrea, et autres
Publié: (2023)

Minimum acyclic number and maximum dichromatic number of oriented triangle-free graphs of a given order
par: Aboulker, Pierre, et autres
Publié: (2024)

Backbone colouring of chordal graphs
par: Araújo, Júlio, et autres
Publié: (2025)

Adjacency labelling for proper minor-closed graph classes
par: Dujmović, Vida, et autres
Publié: (2026)

On the expressive power of $2$-edge-colourings of graphs
par: Bok, Jan, et autres
Publié: (2025)

Star colouring and locally constrained graph homomorphisms
par: Antony, Cyriac, et autres
Publié: (2023)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
par: Pilipczuk, Marcin, et autres
Publié: (2023)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
par: Char, Arnab, et autres
Publié: (2024)

Faster 3-colouring algorithm for graphs of diameter 3
par: Groenland, Carla, et autres
Publié: (2026)

Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
par: Beaudou, Laurent, et autres
Publié: (2021)

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
par: Falgas-Ravry, Victor, et autres
Publié: (2022)

New bounds for the optimal density of covering single-insertion codes via the Turán density
par: Pikhurko, Oleg, et autres
Publié: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
par: Claus, Quentin, et autres
Publié: (2026)

Upper bounds on minimum size of feedback arc set of directed multigraphs with bounded degree
par: Gutin, Gregory, et autres
Publié: (2024)

Clustered independence and bounded treewidth
par: Knauer, Kolja, et autres
Publié: (2023)

The sandwich problem for odd-hole-free and even-hole-free graphs
par: Cameron, Kathie, et autres
Publié: (2024)

Excluding an apex-forest or a fan as quickly as possible
par: Claus, Quentin, et autres
Publié: (2026)

An explicit condition for boundedly supermultiplicative subshifts
par: Bui, Vuong, et autres
Publié: (2024)

An improvement on the bound for the acyclic chromatic index
par: Kirousis, Lefteris, et autres
Publié: (2026)

Elimination distance to bounded degree on planar graphs
par: Lindermayr, Alexander, et autres
Publié: (2020)

Trees with proper thinness 2
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Strong odd colorings in graph classes of bounded expansion
par: Pilipczuk, Michał
Publié: (2025)

Long induced paths and forbidden patterns: Polylogarithmic bounds
par: Duron, Julien, et autres
Publié: (2024)

Cops and robber in graphs with bounded vertex cover number
par: Bose, Prosenjit, et autres
Publié: (2026)

Increasing arc-connectivity by bounded- and fixed-size inversions
par: Hörsch, Florian, et autres
Publié: (2026)

Bounded twin-width graphs are polynomially $χ$-bounded
par: Bourneuf, Romain, et autres
Publié: (2023)

Tight bound for the Erdős-Pósa property of tree minors
par: Dujmović, Vida, et autres
Publié: (2024)

Tight bound on treedepth in terms of pathwidth and longest path
par: Hatzel, Meike, et autres
Publié: (2023)

Token positional games
par: Bagan, Guillaume, et autres
Publié: (2026)

The chromatic number of triangle-free hypergraphs
par: Li, Lina, et autres
Publié: (2022)

$θ$-free matching covered graphs
par: Joshi, Rohinee, et autres
Publié: (2024)

Coloring bridge-free antiprismatic graphs
par: Robin, Cléophée, et autres
Publié: (2024)

Conflict-free chromatic index of trees
par: Guo, Shanshan, et autres
Publié: (2024)