Premium
Strongly Hamiltonian‐connected locally semicomplete digraphs
Author(s) -
Guo Yubao
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199605)22:1<65::aid-jgt9>3.0.co;2-j
Subject(s) - digraph , mathematics , vertex (graph theory) , hamiltonian (control theory) , combinatorics , hamiltonian path , strongly connected component , path (computing) , discrete mathematics , graph , computer science , mathematical optimization , computer network
We give some sufficient conditions for locally semicomplete digraphs to contain a hamiltonian path from a prescribed vertex to another prescribed vertex. As an immediate consequence of these, we obtain that every 4‐connected locally semicomplete digraph is strongly hamiltonian‐connected. Our results extend those of Thomassen [12] for tournaments. © 1996 John Wiley & Sons, Inc.