#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1994

2017

- This year (2)
- Last 5 years (17)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yubao Guo, Lutz Volkmann
- Journal of Graph Theory
- 1996

- Yubao Guo, Lutz Volkmann
- Journal of Graph Theory
- 1994

- Jørgen Bang-Jensen, Yubao Guo, Gregory Gutin, Lutz Volkmann
- Discrete Mathematics
- 1997

In [19] Huang gave a characterization of local tournaments. His characterization involves arc-reversals and therefore may not be easily used to solve other structural problems on locally semicomplete digraphs (where one deals with a fixed locally semicomplete digraph). In this paper we derive a classification of locally semicomplete digraphs which is very… (More)

- Yubao Guo, Lutz Volkmann
- Discrete Mathematics
- 1994

- Tianxing Yao, Yubao Guo, Kemin Zhang
- Discrete Applied Mathematics
- 2000

Thomassen (J. Combin. Theory Ser. B 28, 1980, 142–163) proved that every strong tournament contains a vertex x such that each arc going out from x is contained in a Hamiltonian cycle. In this paper, we extend the result of Thomassen and prove that a strong tournament contains a vertex x such that every arc going out from x is pancyclic, and our proof yields… (More)

- Yubao Guo, Lutz Volkmann
- J. Comb. Theory, Ser. B
- 1994

- Yubao Guo
- Journal of Graph Theory
- 1996

- Jørgen Bang-Jensen, Yubao Guo, Anders Yeo
- Discrete Applied Mathematics
- 1999

In 2] the following extension of Meyniels theorem was conjectured: If D is a digraph on n vertices with the property that d(x) + d(y) 2n ? 1 for every pair of non-adjacent vertices x; y with a common out-neighbour or a common in-neighbour, then D is Hamiltonian. We verify the conjecture in the special case where we also require that minfd + (x)+d ? (y); d ?… (More)

- Yubao Guo, Jin Ho Kwak
- Discrete Applied Mathematics
- 1999

- Ronald J. Gould, Yubao Guo
- 2004

A digraph is locally semicomplete if for every vertex x, the set of in-neighbors as well as the set of out-neighbors of x induce semicomplete digraphs. Let D be a k-connected locally semicomplete digraph with k ≥ 3 and g denote the length of a longest induced cycle of D. It is shown that if D has at least 7(k− 1)g vertices, then D has a factor composed of k… (More)