Disjoint directed cycles in directed graphs
From MaRDI portal
Recommendations
Cites work
- Digraphs containing every possible pair of dicycles
- Disjoint directed quadrilaterals in a directed graph
- Edge disjoint placement of graphs
- Embedding Arbitrary Graphs of Maximum Degree Two
- Graph theory with applications
- scientific article; zbMATH DE number 825135 (Why is no real title available?)
- Independent directed triangles in a directed graph
- On circuits in graphs
- On maximal paths and circuits of graphs
- On the maximal number of independent circuits in a graph
- Proof of the Erdős-Faudree conjecture on quadrilaterals
Cited in
(13)- Disjoint directed and undirected paths and cycles in digraphs
- On digraphs with no two disjoint directed cycles
- An improved bound for disjoint directed cycles
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
- Note on the existence of directed (k + 1)-cycles in diconnected completek-partite digraphs
- scientific article; zbMATH DE number 6890341 (Why is no real title available?)
- scientific article; zbMATH DE number 825135 (Why is no real title available?)
- scientific article; zbMATH DE number 908792 (Why is no real title available?)
- Disjoint directed triangles and quadrilaterals in directed graphs
- Disjoint directed quadrilaterals in a directed graph
- Disjoint Cycles in a Digraph with Partial Degree
- Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
- On partitioning a bipartite graph into a specified number of cycles and degree sum conditions for two vertices of distance three
This page was built for publication: Disjoint directed cycles in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185930)
