Directed triangles in digraphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3861195 (Why is no real title available?)
- scientific article; zbMATH DE number 3630786 (Why is no real title available?)
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
- Directed triangles in directed graphs
- On minimal regular digraphs with given girth
Cited in
(24)- Directed triangles in directed graphs
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- On directed triangles in digraphs
- Color degree and heterochromatic cycles in edge-colored graphs
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
- A new bound for a particular case of the Caccetta-Häggkvist conjecture
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- Independent directed triangles in a directed graph
- Cycles of given length in oriented graphs
- Degree conditions forcing oriented cycles
- Rainbow triangles in edge-colored graphs
- On Sullivan's conjecture on cycles in 4-free and 5-free digraphs
- On short cycles in triangle-free oriented graphs.
- Properly colored short cycles in edge-colored graphs
- The binding number of a digraph and its computation
- Short cycles in oriented graphs
- Some approaches to a conjecture on short cycles in digraphs
- Bounds on the acyclic disconnection of a digraph
- Path-monochromatic bounded depth rooted trees in (random) tournaments
- On the Chudnovsky-Seymour-Sullivan conjecture on cycles in triangle-free digraphs
- Digraphs without directed path of length two or three
- The Binding Number of a Digraph
- Short rainbow cycles in graphs and matroids
This page was built for publication: Directed triangles in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127878)
