scientific article; zbMATH DE number 3630786

From MaRDI portal
Publication:4192089

zbMath0406.05033MaRDI QIDQ4192089

Louis Caccetta, Roland Haeggkvist

Publication date: 1978


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (59)

Some approaches to a conjecture on short cycles in digraphsFurther approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjectureTurán number of 3-free strong digraphs with out-degree restrictionVertex-disjoint rainbow cycles in edge-colored graphsConcatenating bipartite graphsColorful FlowersSeymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized StarA note on minimal directed graphs with given girthCounting subgraphs: A new approach to the Caccetta-Häggkvist conjectureThe number of Seymour vertices in random tournaments and digraphsShort cycles in digraphsOn Aharoni's rainbow generalization of the Caccetta-Häggkvist conjectureDirected triangles in digraphsRainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphsTotal domination and the Caccetta-Häggkvist conjectureProof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number twoShort rainbow cycles in graphs and matroidsRainbow cycles for families of matchingsImproved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjectureChoice functionsAn Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing ProblemOn Seymour's and Sullivan's second neighbourhood conjecturesOn Multicolor Ramsey Numbers of Triple System Paths of Length 3Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist ConjectureRainbow cycles in edge-colored graphsColor degree and heterochromatic cycles in edge-colored graphsOn the co-degree threshold for the Fano planeRainbow triangles in edge-colored graphsShort directed cycles in bipartite digraphsSemantic limits of dense combinatorial objectsSeymour's second neighborhood conjecture for 6-antitransitive digraphsHoàng-Reed conjecture holds for tournamentsCycles in dense digraphsOn the Caccetta-Häggkvist conjecture with a forbidden transitive tournamentCounting flags in triangle-free digraphsCycles of given length in oriented graphsCounting paths in digraphsProof of the Caccetta-Häggkvist conjecture for digraphs with small independence numberDirected triangles in directed graphsThe Hoàng-Reed conjecture for \(\delta ^{+}=3\)A new bound for a particular case of the Caccetta-Häggkvist conjectureA note on short cycles in digraphsOn the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivityA new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjectureA note on approximate Nash equilibriaDomination in Digraphs3-free strong digraphs with the maximum sizeTriangle packings and 1-factors in oriented graphsProperly colored short cycles in edge-colored graphsUnnamed ItemExtending some results on the second neighborhood conjectureColor degree and alternating cycles in edge-colored graphsTournaments and Semicomplete DigraphsShort cycles in oriented graphsMixed cagesOn the Caccetta-Häggkvist Conjecture with Forbidden SubgraphsCyclic triangle factors in regular tournamentsThe 2-linkage problem for acyclic digraphsShort cycles in directed graphs




This page was built for publication: