Pages that link to "Item:Q2560256"

The following pages link to Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente (Q2560256):

Displaying 33 items.

• A degree condition for cycles of maximum length in bipartite digraphs (Q409445) (← links)
• A survey on Hamilton cycles in directed graphs (Q412269) (← 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)
• Number of arcs and cycles in digraphs (Q799688) (← links)
• A sufficient condition for cyclability in directed graphs (Q878617) (← links)
• Pancyclism and Meyniel's conditions (Q1071026) (← links)
• Hamiltonian-connected tournaments (Q1140091) (← links)
• Degrees and cycles in digraphs (Q1165865) (← links)
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs (Q1186314) (← links)
• Hamiltonian paths in oriented graphs (Q1212471) (← links)
• Sur les arborescences dans un graphe oriente (Q1229222) (← links)
• An Ore-type condition implying a digraph to be pancyclic (Q1239327) (← links)
• A short proof of Meyniel's theorem (Q1242928) (← links)
• Covering digraphs by paths (Q1250116) (← links)
• A theorem on pancyclic-oriented graphs (Q1252867) (← links)
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem (Q1272469) (← links)
• Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114) (← links)
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
• On pancyclic digraphs (Q1844685) (← links)
• Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments (Q2005723) (← links)
• Degree condition for a digraph to be supereulerian (Q2062894) (← links)
• Sufficient Ore type condition for a digraph to be supereulerian (Q2245087) (← links)
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
• A dominated pair condition for a digraph to be Hamiltonian (Q2305908) (← links)
• Supereulerian digraphs with large arc-strong connectivity (Q2800596) (← links)
• Locally Semicomplete Digraphs and Generalizations (Q3120438) (← links)
• (Q3300694) (← links)
• Circuits including a given set of vertices (Q3744185) (← links)
• A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture (Q4987265) (← links)
• Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs (Q5024671) (← links)
• Sufficient Conditions for a Digraph to be Supereulerian (Q5251197) (← links)
• An Ore-type condition for cyclability (Q5949032) (← links)