Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
From MaRDI portal
Publication:2560256
DOI10.1016/0095-8956(73)90057-9zbMath0259.05114OpenAlexW2121867501WikidataQ29543433 ScholiaQ29543433MaRDI QIDQ2560256
Publication date: 1973
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(73)90057-9
Related Items
Unnamed Item ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Circuits including a given set of vertices ⋮ A sufficient condition for cyclability in directed graphs ⋮ Hamiltonian-connected tournaments ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ A survey on Hamilton cycles in directed graphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Degrees and cycles in digraphs ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ Alternating Hamiltonian circuits in edge-coloured bipartite graphs ⋮ 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 ⋮ Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments ⋮ Hamiltonian paths in oriented graphs ⋮ Sur les arborescences dans un graphe oriente ⋮ An Ore-type condition for cyclability ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ An Ore-type condition implying a digraph to be pancyclic ⋮ A short proof of Meyniel's theorem ⋮ Supereulerian Digraphs with Large Arc-Strong Connectivity ⋮ Covering digraphs by paths ⋮ A theorem on pancyclic-oriented graphs ⋮ A dominated pair condition for a digraph to be Hamiltonian ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem ⋮ Degree condition for a digraph to be supereulerian ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ On pancyclic digraphs ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ Number of arcs and cycles in digraphs ⋮ Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs ⋮ Pancyclism and Meyniel's conditions
Cites Work
