Cover Image

Bounding the chromatic number of dense digraphs by arc neighborhoods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Klingelhoefer, Felix, Newman, Alantha
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the minimum number of inversions to make a digraph $k$-(arc-)strong
by: Duron, Julien, et al.
Published: (2023)

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

Karp's patching algorithm on dense digraph
by: Frieze, Alan
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)

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

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

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

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

A new vertex coloring heuristic and corresponding chromatic number
by: Zaker, Manouchehr
Published: (2020)

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

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

Invertibility of digraphs and tournaments
by: Alon, Noga, et al.
Published: (2022)

Counting the minimum number of arcs in an oriented graph having weak diameter 2
by: Das, Sandip, et al.
Published: (2023)

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

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

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

Three-chromatic geometric hypergraphs
by: Damásdi, Gábor, et al.
Published: (2021)

Algorithms and hardness for Metric Dimension on digraphs
by: Dailly, Antoine, et al.
Published: (2023)

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

Conflict-free chromatic index of trees
by: Guo, Shanshan, et al.
Published: (2024)

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

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

Dividing sums of cycles in the semiring of functional digraphs
by: Bridoux, Florian, et al.
Published: (2025)

There is no prime functional digraph: Seifert's proof revisited
by: Richard, Adrien
Published: (2025)

The complexity of computing the period and the exponent of a digraph
by: Kiefer, Stefan, et al.
Published: (2024)

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

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr's conjecture
by: Bessy, Stéphane, et al.
Published: (2024)

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

Unavoidable butterfly minors in digraphs of large cycle rank
by: Hatzel, Meike, et al.
Published: (2025)

On powers of circular arc graphs
by: Das, Ashok Kumar, et al.
Published: (2022)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

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

On acyclic b-chromatic number of cubic graphs
by: Anholcer, Marcin, et al.
Published: (2025)

Extremal digraphs for open neighbourhood location-domination and identifying codes
by: Foucaud, Florent, et al.
Published: (2023)

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

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

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

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