Premium
Weakly Hamiltonian‐connected locally semicomplete digraphs
Author(s) -
BangJensen Jørgen,
Guo Yubao,
Volkmann Lutz
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(199602)21:2<163::aid-jgt5>3.0.co;2-p
Subject(s) - mathematics , hamiltonian (control theory) , combinatorics , discrete mathematics , mathematical optimization
We characterize weakly hamiltonian‐connected locally semicomplete digraphs. Our result extends those of Thomassen. ( J. Combinatorial Theory B 28 (1980), 142–163) for tournaments. © 1996 John Wiley & Sons, Inc.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom