Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem

DOI10.1006/jctb.1998.1829zbMath0914.05032OpenAlexW2142698005MaRDI QIDQ1272469

Xin Liu, Kenneth A. Berman

Publication date: 7 June 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/dad3f3006429f5242b84b8154a7162bc54dcb03b

zbMATH Keywords

cycledigraphHamiltonianMeyniel setMeyniel's theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Disjoint Cycles in a Digraph with Partial Degree ⋮ Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• The directed subgraph homeomorphism problem
• Cycles containing many vertices of large degree
• In-tournament digraphs
• Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
• Locally semicomplete digraphs: A generalization of tournaments
• Directed hamiltonian graphs
• 2‐neighborhoods and hamiltonian conditions
• Cycles containing all vertices of maximum degree
• Cycles through vertices of large maximum degree
• Sufficient Conditions for Circuits in Graphs^†

This page was built for publication: Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem