A short proof of Meyniel's theorem

DOI10.1016/0012-365X(77)90034-6zbMath0368.05029OpenAlexW2078698054MaRDI QIDQ1242928

Carsten Thomassen, J. A. Bondy

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90034-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (12)

The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ A degree condition for cycles of maximum length in bipartite digraphs ⋮ One-to-one disjoint path covers in digraphs ⋮ Sufficient conditions for a balanced bipartite digraph to be even pancyclic ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs ⋮ Sufficient conditions for Hamiltonian cycles in bipartite digraphs ⋮ On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li ⋮ An Ore-type condition implying a digraph to be pancyclic ⋮ A dominated pair condition for a digraph to be Hamiltonian ⋮ Sufficient Conditions for a Digraph to be Supereulerian ⋮ About some cyclic properties in digraphs

Cites Work

• Unnamed Item
• Hamiltonian paths in oriented graphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente

This page was built for publication: A short proof of Meyniel's theorem