scientific article; zbMATH DE number 3630786

Cited in

(63)

Rainbow cycles for families of matchings
Degree conditions forcing oriented cycles
Bounds on the acyclic disconnection of a digraph
Path-monochromatic bounded depth rooted trees in (random) tournaments
On Seymour's and Sullivan's second neighbourhood conjectures
Notes on Aharoni's rainbow cycle conjecture
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
Colorful Flowers
Short rainbow cycles for families of matchings and triangles
Some approaches to a conjecture on short cycles in digraphs
Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
Concatenating bipartite graphs
Vertex-disjoint rainbow cycles in edge-colored graphs
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
Total domination and the Caccetta-Häggkvist conjecture
The number of Seymour vertices in random tournaments and digraphs
Short directed cycles in bipartite digraphs
A note on short cycles in digraphs
Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
Proof of the Caccetta-Häggkvist conjecture for digraphs with small independence number
Seymour's second neighborhood conjecture for tournaments missing a generalized star
On Multicolor Ramsey Numbers of Triple System Paths of Length 3
Cycles of given length in oriented graphs
3-free strong digraphs with the maximum size
Color degree and heterochromatic cycles in edge-colored graphs
Rainbow triangles in edge-colored graphs
Rainbow cycles in edge-colored graphs
Extending some results on the second neighborhood conjecture
scientific article; zbMATH DE number 2230268 (Why is no real title available?)
Counting paths in digraphs
Semantic limits of dense combinatorial objects
Tournaments and Semicomplete Digraphs
A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
Mixed cages
Short cycles in oriented graphs
Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two
On the Caccetta-Häggkvist conjecture with forbidden subgraphs
Short rainbow cycles in graphs and matroids
The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
A new bound for a particular case of the Caccetta-Häggkvist conjecture
Triangle packings and 1-factors in oriented graphs
Seymour's second neighborhood conjecture for 6-antitransitive digraphs
Color degree and alternating cycles in edge-colored graphs
Choice functions
Directed triangles in digraphs
Short cycles in directed graphs
A note on minimal directed graphs with given girth
Turán number of 3-free strong digraphs with out-degree restriction
On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
Domination in digraphs
Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
A note on approximate Nash equilibria
Properly colored short cycles in edge-colored graphs
Short cycles in digraphs
Cyclic triangle factors in regular tournaments
Hoàng-Reed conjecture holds for tournaments
The 2-linkage problem for acyclic digraphs
Directed triangles in directed graphs
On the co-degree threshold for the Fano plane
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
Cycles in dense digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192089)