Pages that link to "Item:Q5641174"

The following pages link to Sufficient Conditions for Circuits in Graphs^† (Q5641174):

Displayed 50 items.

• A note on Turán numbers for even wheels (Q367087) ‎ (← links)
• On directed versions of the Corrádi-Hajnal corollary (Q404438) ‎ (← links)
• A degree condition for cycles of maximum length in bipartite digraphs (Q409445) ‎ (← links)
• A survey on Hamilton cycles in directed graphs (Q412269) ‎ (← links)
• Euler index in uncertain graph (Q449488) ‎ (← links)
• Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs (Q477633) ‎ (← links)
• On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li (Q516779) ‎ (← links)
• Cycles in 2-connected graphs (Q705891) ‎ (← links)
• Spectral extrema of graphs: forbidden hexagon (Q785828) ‎ (← links)
• A sufficient condition for cyclability in directed graphs (Q878617) ‎ (← links)
• Almost symmetric cycles in large digraphs (Q882781) ‎ (← links)
• Proof of a conjecture of Haeggkvist on cycles and independent edges (Q1050353) ‎ (← links)
• About some cyclic properties in digraphs (Q1058520) ‎ (← links)
• Extremal problems involving vertices and edges on odd cycles (Q1197010) ‎ (← links)
• On maximal circuits in directed graphs (Q1213883) ‎ (← links)
• On path connected graphs (Q1226503) ‎ (← links)
• Sur les arborescences dans un graphe oriente (Q1229222) ‎ (← links)
• An Ore-type condition implying a digraph to be pancyclic (Q1239327) ‎ (← links)
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) ‎ (← links)
• On cycle lengths in graphs of moderate degree (Q1322247) ‎ (← links)
• Graphs with large maximum degree containing no odd cycles of a given length (Q1405126) ‎ (← links)
• On completely positive graphs and their complements (Q1406281) ‎ (← links)
• The smallest degree sum that yields potentially \(_{k}C_{\ell}\)-graphic sequences (Q1406566) ‎ (← links)
• Vertex pancyclic graphs (Q1613376) ‎ (← links)
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114) ‎ (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) ‎ (← links)
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) ‎ (← links)
• Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems (Q1752690) ‎ (← links)
• On pancyclic digraphs (Q1844685) ‎ (← links)
• An extremal problem for cycles in hamiltonian graphs (Q1900521) ‎ (← links)
• On degree sum conditions for directed path-factors with a specified number of paths (Q2005702) ‎ (← links)
• Finding long cycles in balanced tripartite graphs: a first step (Q2073190) ‎ (← links)
• Adjacency eigenvalues of graphs without short odd cycles (Q2237217) ‎ (← links)
• A spectral condition for odd cycles in non-bipartite graphs (Q2238862) ‎ (← links)
• Sufficient Ore type condition for a digraph to be supereulerian (Q2245087) ‎ (← links)
• Sufficient conditions for a graph to be Hamiltonian (Q2265440) ‎ (← links)
• Minimal paths and cycles in set systems (Q2372429) ‎ (← links)
• Large cycles in graphs (Q2548258) ‎ (← links)
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente (Q2560256) ‎ (← links)
• An anti-Ramsey theorem on cycles (Q2573806) ‎ (← links)
• Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) ‎ (← links)
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles (Q2689639) ‎ (← links)
• Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) ‎ (← links)
• Long cycles in subgraphs of (pseudo)random directed graphs (Q2897207) ‎ (← links)
• Locally Semicomplete Digraphs and Generalizations (Q3120438) ‎ (← links)
• Long cycles in graphs and digraphs (Q3439406) ‎ (← links)
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (Q3529511) ‎ (← links)
• A sufficient condition for 𝑘-path Hamiltonian digraphs (Q4091982) ‎ (← links)
• Maximal circuits of graphs. I (Q4103567) ‎ (← links)
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs (Q4602862) ‎ (← links)