Sufficient Conditions for Circuits in Graphs†
From MaRDI portal
Publication:5641174
DOI10.1112/PLMS/S3-24.4.739zbMath0233.05117OpenAlexW2082270016MaRDI QIDQ5641174
Publication date: 1972
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-24.4.739
Related Items (63)
Vertex pancyclic graphs ⋮ Long cycles in subgraphs of (pseudo)random directed graphs ⋮ Minimal paths and cycles in set systems ⋮ An extremal problem for cycles in hamiltonian graphs ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ A note on Turán numbers for even wheels ⋮ A sufficient condition for cyclability in directed graphs ⋮ Almost symmetric cycles in large digraphs ⋮ Extremal digraphs on Woodall‐type condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ On directed versions of the Corrádi-Hajnal corollary ⋮ Exact bipartite Turán numbers of large even cycles ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ Pseudo-Matchings of a Bipartite Graph ⋮ A survey on Hamilton cycles in directed graphs ⋮ Graphs with large maximum degree containing no odd cycles of a given length ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ On completely positive graphs and their complements ⋮ Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph ⋮ The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences ⋮ Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles ⋮ On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Extremal Numbers for Odd Cycles ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Euler index in uncertain graph ⋮ Unnamed Item ⋮ A Dirac-Type Result on Hamilton Cycles in Oriented Graphs ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ A sufficient condition for 𝑘-path Hamiltonian digraphs ⋮ Adjacency eigenvalues of graphs without short odd cycles ⋮ A spectral condition for odd cycles in non-bipartite graphs ⋮ Maximal circuits of graphs. I ⋮ Sufficient Ore type condition for a digraph to be supereulerian ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ Extremal problems involving vertices and edges on odd cycles ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ On degree sum conditions for directed path-factors with a specified number of paths ⋮ On maximal circuits in directed graphs ⋮ Sufficient conditions for a graph to be Hamiltonian ⋮ Cycles in 2-connected graphs ⋮ On path connected graphs ⋮ Sur les arborescences dans un graphe oriente ⋮ An Ore-type condition implying a digraph to be pancyclic ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Large cycles in graphs ⋮ Finding long cycles in balanced tripartite graphs: a first step ⋮ Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente ⋮ Spectral extrema of graphs: forbidden hexagon ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Proof of a conjecture of Haeggkvist on cycles and independent edges ⋮ On pancyclic digraphs ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ An anti-Ramsey theorem on cycles ⋮ About some cyclic properties in digraphs ⋮ Long cycles in graphs and digraphs ⋮ On cycle lengths in graphs of moderate degree
This page was built for publication: Sufficient Conditions for Circuits in Graphs†
