Prof. Dr. Yubao Guo

Institute C for Mathematics
RWTH Aachen
Templergraben 55
52056 Aachen
Germany

Telefon:	++49-241-8096950
Fax:	++49-241-8092390
e-mail:	guo@mathc.rwth-aachen.de

Deutsche Version

Publications

1	Y. Guo and L. Volkmann, Connectivity properties of locally semicomplete digraphs, J. Graph Theory 18 (1994), 269-280.
2	Y. Guo and L. Volkmann, Cycles in multipartite tournaments, J. Combin. Theory Ser. B 62 (1994), 363-366.
3	Y. Guo and L. Volkmann, On complementary cycles in locally semicomplete digraphs, Discrete Math. 135 (1994), 121-127.
4	Y. Guo, Locally Semicomplete Digraphs. PhD thesis, RWTH Aachen, Germany. Aachener Beiträge zur Mathematik 13, Augustinus-Buchhandlung Aachen 1995.
5	Y. Guo and L. Volkmann, A generalization of Menger's theorem for certain block-cactus graphs, Graphs Combin. 11 (1995), 49-52.
6	Y. Guo and L. Volkmann, Tree-Ramsey numbers, Australas. J. Combin. 11 (1995), 169-175.
7	Y. Guo and L. Volkmann, A complete solution of a problem of Bondy concerning multipartite tournaments, J. Combin. Theory Ser. B 66 (1996), 140-145.
8	Y. Guo and L. Volkmann, Locally semicomplete digraphs that are complementary m-pancyclic, J. Graph Theory 21 (1996), 121-136.
9	J. Bang-Jensen, Y. Guo and L. Volkmann, Weakly hamiltonian-connected locally semicomplete digraphs, J. Graph Theory 21 (1996), 163-172.
10	Y. Guo, Strongly hamiltonian-connected locally semicomplete digraphs, J. Graph Theory 22 (1996), 65-73.
11	Y. Guo, A. Pinkernell and L. Volkmann, On cycles through a given vertex in multipartite tournaments, Discrete Math. 164 (1997), 165-170.
12	J. Bang-Jensen, Y. Guo, G. Gutin and L. Volkmann, A classification of locally semicomplete digraphs, Discrete Math. 167/168 (1997), 101-114.
13	Y. Guo, Path-connectivity in local tournaments, Discrete Math. 167/168 (1997), 353-372.
14	Y. Guo, Spanning local tournaments in locally semicomplete digraphs, Discrete Appl. Math., 79 (1997), 119-125.
15	Y. Guo and L. Volkmann, Bypaths in tournaments, Discrete Appl. Math.,79 (1997), 127-135.
16	Y. Guo, Semicomplete Multipartite Digraphs: a Generalization of Tournaments. Habilitation thesis, RWTH Aachen, Germany. 1998.
17	Y. Guo, Some locally semicomplete digraphs that are not strongly hamiltonian-connected, Proc. of the Summer School and International Conference on Combinatorics, Hefei, China, 25 May - 5 June 1995, Vol. 2 (Ed. Ku Tung-Hsin), to appear.
18	Y. Guo, Bypaths in local tournaments, J. Korean Math. Soc.,36 (1999), 431-445.
19	T.-S. Yao, Y. Guo and K.-M. Zhang, ν-paths of arcs in regular multipartite tournaments, Bull. Korean Math. Soc.,36 (1999), 389--394.
20	J. Bang-Jensen and Y. Guo, A note on vertex pancyclic oriented graphs, J. Graph Theory 31 (1999), 313-318.
21	J. Bang-Jensen, Y. Guo and A. Yeo, A new sufficient condition for a digraph to be Hamiltonian, Discrete Appl. Math.,95 (1999), 61-72.
22	Y. Guo, Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math.,95 (1999), 273-277.
23	Y. Guo, M. Tewes, L. Volkmann and A. Yeo, Sufficient conditions for semicomplete multipartite digraphs to be hamiltonian, Discrete Math.,212 (2000), 91-100.
24	T.-S. Yao, Y. Guo and K.-M. Zhang, Pancyclic out-arcs of a vertex in tournaments, Discrete Appl. Math.,99 (2000), 245-249.
25	J. Bang-Jensen, Y. Guo and A. Yeo, Complementary cycles containing prescribed vertices in tournaments, Discrete Math.,214 (2000), 77-87.
26	Y. Guo and J.H. Kwak, The cycle structure of regular multipartite tournaments, Discrete Appl. Math.,120 (2002), 109-116.
27	A. Grooterhorst, G. Helden und Y. Guo, Mit dem Zufall planan --- Eine neue Methode ermöglicht fundiertere Prognosen über die Entwicklung von Abfallmengen, Müllmagazin, 4 (2002), 18-24.
28	Y. Guo and L. Volkmann, Extendable cycles in multipartite tournaments, Graphs Combin.,20 (2004), 185-190.
29	R.J. Gould and Y. Guo, Locally semicomplete digraph with a factor composed of k cycles, J. Korean Math. Soc.,41 (2004), 895-912.
30	J. Feng, H.-E. Giesen, Y. Guo, G. Gutin, T. Jensen and A. Rafiey, Characterization of edge-colored complete graphs with properly colored Hamilton paths, J. Graph Theory, 53 (4) (2006), 333 - 346.
31	J. Feng and Y. Guo, Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws, Optimization, 57 (2008), 135 - 141.
32	J. Feng and Y. Guo, Hamiltonian problem on claw-free and almost distance-hereditary graphs, Discrete Math. (2008), doi:10.1016/j.disc.2007.11.063.
33	S. Li, W. Meng and Y. Guo, Three extensions of Reid's theorem in multipartite tournaments, Discrete Appl. Math. (2009), doi:10.1016/j.dam.2009.05.004.
34	R. Li, S. Li and Y. Guo, Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian, Discrete Appl. Math. (2009), doi:10.1016/j.dam.2009.05.005.
35	S. Li, W. Meng and Y. Guo, A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic, J. Graph Theory (2009), doi:10.1002/jgt.20410.
36	Q. Guo, S. Li, Y. Guo and H. Li Out-arc pancyclicity of vertices in tournaments, Discrete Appl. Math.,158 (2010), 996-1005.
37	H. Li, S. Li, Y. Guo and Q. Guo Cycles through arcs in multipartite tournaments and a conjecture of Volkmann, Appl. Math. lett., 24 (2011), 412-415.
38	F. Birchel, Y. Guo and G. Helden, Hamilton cycle in planar triangulations with separating triangles, submitted.
39	Y. Guo and M. Lu Strongly quasi-hamiltonian-connected multipartite tournaments, submitted.

Y. Guo - August 3, 2011

Prof. Dr. Yubao Guo

Publications

Links