Pancyclism and Meyniel's conditions
type: Item
instance of: scholarly article
title: Pancyclism and Meyniel's conditions
zbMATH Open document ID: 0585.05008
DOI: 10.1016/0012-365X(86)90155-X
author: Abdelhamid Benhocine
published in: Discrete Mathematics
publication date: 1986-01-01T00:00:00Z
review text: \textit{H. Meyniel} [J. Comb. Theory, Ser. B 14, 137-147 (1973; Zbl 0259.05114)] has shown that a digraph of order n is Hamiltonian if for each pair of non adjacent vertices the degree sum is at least 2n-1. In accordance with \textit{J. A. Bondy's} metaconjecture [Proc. 2nd Louisiana Conf. Comb., Graph Theory, Comput., Baton Rouge, 161-172 (1971; Zbl 0291.05109)] the author proves that a digraph satisfying the same condition is pancyclic excepted if it is of one of 4 precised types. This result generalizes previous results obtained by Overbeck-Larish and Thomassen by considering stronger conditions on the degree sum of nonadjacent vertices.
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 3937193
zbMATH Keywords: degree sum
zbMATH Keywords: digraph
zbMATH Keywords: pancyclic
reviewed by: Marie-Claude Heydemann
MaRDI profile type: Publication
cites work: Q3220619
cites work: Q4041607
cites work: On pancyclic digraphs
cites work: Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
cites work: A theorem on pancyclic-oriented graphs
cites work: An Ore-type condition implying a digraph to be pancyclic
description: scientific article; zbMATH DE number 3937193