Y. Guo, Strongly hamiltonian-connected locally semicomplete digraphs, J. Graph Theory 22 (1996) 65-73. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Complexity of Hamiltonian Path and Cycle Problems in .. - Bang-Jensen, Gutin (1997) (Correct)
....mathematical characterization and as a consequence of their characterization it follows that the HP[x,y] problem is polynomially solvable for locally semicomplete digraphs. Conjecture 5.18 The HPxy problem is in P for locally semicomplete digraphs. Some support for this conjecture is given in [29] where Y. Guo proved that every 4 strongly connected locally semicomplete digraph D has an (x; y) hamiltonian path for any choice of distinct vertices x; y 2 V (D) The analogoue of this result for semicomplete digraphs was proved by C. Thomassen [48] and this result was used in the proof of ....
Y. Guo, Strongly hamiltonian-connected locally semicomplete digraphs, J. Graph Theory 22 (1996) 65-73.
Generalizations of tournaments: A survey - Bang-Jensen, Gutin (1996) (Correct)
....connected semicomplete digraph is strongly hamiltonian connected and gave an infinite family of 3 strongly connected tournaments which are not strongly hamiltonian connected [77] Recently Guo extended this to locally semicomplete digraphs. His main result is the following. Theorem 9. 3 [43] Let D be a 2 strongly connected locally semicomplete digraph and let x; y be two distinct vertices of D. Then D contains a hamiltonian path from x to y if (a) or (b) below is satisfied. a) The digraph D has two internally disjoint (x; y) paths P 1 ; P 2 , each of which is of length at least 2 ....
Y. Guo, Strongly Hamiltonian-connected locally semicomplete digraphs, J. Graph Theory, 22 (1996) 65--73.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC