On maximal circuits in directed graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3149611 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- Large cycles in graphs
- On maximal paths and circuits of graphs
- Sufficient Conditions for Circuits in Graphs†
Cited in
(18)- Extensions of the Erdős-Gallai theorem and Luo's theorem
- A family of perfect factorisations of complete bipartite graphs
- On \(r\)-uniform hypergraphs with circumference less than \(r\)
- Long cycles in graphs and digraphs
- Extending cycles in directed graphs
- On 2-connected hypergraphs with no long cycles
- On the size of maximally non-Hamiltonian digraphs
- Non-Hamiltonian graphs with large minimum degree
- The maximum number of cliques in graphs without long cycles
- Long cycles in subgraphs of (pseudo)random directed graphs
- Cycles in strong oriented graphs
- Stability in the Erdős-Gallai theorems on cycles and paths
- Stability results on the circumference of a graph
- About some cyclic properties in digraphs
- Hamiltonian paths and cycles, number of arcs and independence number in digraphs
- Number of arcs and cycles in digraphs
- Stability in the Erdős-Gallai theorem on cycles and paths. II
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
This page was built for publication: On maximal circuits in directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213883)
