On maximal circuits in directed graphs
From MaRDI portal
Publication:1213883
DOI10.1016/0095-8956(75)90045-3zbMath0297.05119OpenAlexW2083978161MaRDI QIDQ1213883
Publication date: 1975
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(75)90045-3
Related Items (18)
Long cycles in subgraphs of (pseudo)random directed graphs ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ The maximum number of cliques in graphs without long cycles ⋮ Non-Hamiltonian graphs with large minimum degree ⋮ Cycles in strong oriented graphs ⋮ Stability in the Erdős-Gallai theorem on cycles and paths. II ⋮ Hamiltonian paths and cycles, number of arcs and independence number in digraphs ⋮ Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs ⋮ Extending cycles in directed graphs ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ On the size of maximally non-hamiltonian digraphs ⋮ On \(r\)-uniform hypergraphs with circumference less than \(r\) ⋮ Stability results on the circumference of a graph ⋮ On 2-connected hypergraphs with no long cycles ⋮ About some cyclic properties in digraphs ⋮ Number of arcs and cycles in digraphs ⋮ Long cycles in graphs and digraphs ⋮ A family of perfect factorisations of complete bipartite graphs
Cites Work
This page was built for publication: On maximal circuits in directed graphs
