#### Filter Results:

#### Publication Year

1994

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

- Shengjia Li, Wei Meng, Yubao Guo
- CTW
- 2007

An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edge-colored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C 0 and a (possibly empty) collection of properly colored… (More)