On maximal circuits in directed graphs

DOI10.1016/0095-8956(75)90045-3zbMath0297.05119MaRDI QIDQ1213883

Mordechai Lewin

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

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C20: Directed graphs (digraphs), tournaments

Related Items

Extensions of the Erdős–Gallai theorem and Luo’s theorem, On the size of maximally non-hamiltonian digraphs, Stability in the Erdős-Gallai theorems on cycles and paths, Extending cycles in directed graphs, Stability results on the circumference of a graph, Number of arcs and cycles in digraphs, About some cyclic properties in digraphs, Cycles in strong oriented graphs, 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, A family of perfect factorisations of complete bipartite graphs, The maximum number of cliques in graphs without long cycles, Stability in the Erdős-Gallai theorem on cycles and paths. II, On \(r\)-uniform hypergraphs with circumference less than \(r\), On 2-connected hypergraphs with no long cycles, Long cycles in subgraphs of (pseudo)random directed graphs, Long cycles in graphs and digraphs

Cites Work

• Large cycles in graphs
• On maximal paths and circuits of graphs
• Sufficient Conditions for Circuits in Graphs^†
• Unnamed Item
• Unnamed Item
• Unnamed Item