:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Harutyunyan, Ararat, McDiarmid, Colin, Surroca, Gil Puig i
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2603.02947
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Colouring Complete Multipartite and Kneser-type Digraphs
by: Harutyunyan, Ararat, et al.
Published: (2023)

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

On the list version of a conjecture of Erdős and Neumann-Lara
by: Harutyunyan, Ararat, et al.
Published: (2026)

Pendant appearances and components in random graphs from structured classes
by: McDiarmid, Colin
Published: (2021)

On endomorphism universality of sparse graph classes
by: Knauer, Kolja, et al.
Published: (2022)

On rigid regular graphs and a problem of Babai and Pultr
by: Knauer, Kolja, et al.
Published: (2025)

Modularity and partially observed graphs
by: McDiarmid, Colin, et al.
Published: (2021)

Modularity and random graphs
by: McDiarmid, Colin, et al.
Published: (2025)

Hamilton cycles in random digraphs with minimum degree at least one
by: Cooper, Colin, et al.
Published: (2023)

Note on edge expansion and modularity in preferential attachment graphs
by: McDiarmid, Colin, et al.
Published: (2026)

Edge disjoint Hamilton cycles in random digraphs of constant minimum degree
by: Cooper, Colin, et al.
Published: (2026)

Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
by: Olsen, Mika, et al.
Published: (2025)

Feedback vertex sets of digraphs with bounded maximum degree
by: Ai, Jiangdong, et al.
Published: (2025)

On Endomorphism Universality of Sparse Graph Classes
by: Kolja Knauer, et al.
Published: (2025)

Acyclic subgraphs of digraphs with high chromatic number
by: Yuster, Raphael
Published: (2025)

Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
by: Darbinyan, Samvel Kh.
Published: (2025)

On the length of directed paths in digraphs
by: Cheng, Yangyang, et al.
Published: (2024)

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

An end degree for digraphs
by: Hamann, Matthias, et al.
Published: (2024)

Unavoidable subgraphs in digraphs with large out-degrees
by: Hons, Tomáš, et al.
Published: (2025)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Orientations of cycles in digraphs of high chromatic number and high minimum out-degree
by: Koerts, Hidde, et al.
Published: (2025)

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
by: Zhang, Yiran, et al.
Published: (2023)

Counting pairs of cycles whose product is a permutation with restricted cycle lengths
by: Bona, Miklos, et al.
Published: (2024)

Characterization of cycle obstruction sets for improper coloring planar graphs
by: Choi, Ilkyoo, et al.
Published: (2018)

Competition graphs of degree bounded digraphs
by: Chu, Hojin, et al.
Published: (2023)

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

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

Extremal digraphs containing at most $t$ paths of length 2 with the same endpoints
by: Huang, Zejun, et al.
Published: (2024)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

A new condition on dominated pair degree sum for a digraph to be supereulerian
by: Dong, Changchang, et al.
Published: (2024)

Descent set distribution for permutations with cycles of only odd or only even lengths
by: Adin, Ron M., et al.
Published: (2025)

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

Transversal Hamilton cycles in digraph collections
by: Cheng, Yangyang, et al.
Published: (2025)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Planar graphs without cycles of length 4 or 5 are $(7m:2m)$-DP-colorable
by: Xu, Xiaoyan, et al.
Published: (2025)

Pattern-restricted cyclic permutations with a pattern-restricted cycle form
by: Archer, Kassie, et al.
Published: (2024)

Extensions of results on phylogeny graphs of degree bounded digraphs
by: Choi, Myungho, et al.
Published: (2022)

Competition-common enemy graphs of degree-bounded digraphs
by: Choi, Myungho, et al.
Published: (2024)