Publications
1.
Connectivity properties of locally semicomplete digraphs.
J. Graph Theory 18(3): 269-280(1994).
2.
Cycles in multipartite tournaments.
J. Combin. Theory, Ser. B 62(2): 363-366(1994).
3.
On complementary cycles in locally semicomplete digraphs.
Discrete Math. 135(1-3): 121-127(1994).
4.
Locally Semicomplete Digraphs.
Ph.D. thesis, RWTH Aachen University, Germany. Aachener Beiträge zur Mathematik 13, Augustinus-Buchhandlung Aachen 1995.
5.
A generalization of Menger's theorem for certain block-cactus graphs.
Graphs Combin. 11(1): 49-52(1995).
6.
Tree-Ramsey numbers.
Australas. J. Combin. 11: 169-175(1995). PDF
7.
A complete solution of a problem of Bondy concerning multipartite tournaments.
J. Combin. Theory, Ser. B 66(1): 140-145(1996).
8.
Locally semicomplete digraphs that are complementary m-pancyclic.
J. Graph Theory 21(2): 121-136(1996).
doi:10.1002/(SICI)1097-0118(199602)21:2<121::AID-JGT2>3.0.CO;2-T
9.
Weakly hamiltonian-connected locally semicomplete digraphs.
J. Graph Theory 21(2): 163-172(1996).
doi:10.1002/(SICI)1097-0118(199602)21:2<163::AID-JGT5>3.0.CO;2-P
10.
Strongly hamiltonian-connected locally semicomplete digraphs.
J. Graph Theory 22(1): 65-73(1996).
doi:10.1002/(SICI)1097-0118(199605)22:1<65::AID-JGT9>3.0.CO;2-J
11.
On cycles through a given vertex in multipartite tournaments.
Discrete Math. 164(1-3): 165-170(1997).
12.
A classification of locally semicomplete digraphs.
Discrete Math. 167-168: 101-114(1997).
13.
Path-connectivity in local tournaments.
Discrete Math. 167-168: 353-372(1997).
14.
Spanning local tournaments in locally semicomplete digraphs.
Discrete Appl. Math. 79(1-3): 119-125(1997).
15.
Bypaths in tournaments.
Discrete Appl. Math. 79(1-3): 127-135(1997).
16.
Semicomplete Multipartite Digraphs: a Generalization of Tournaments.
Habilitation thesis, RWTH Aachen University, Germany. 1998.
17.
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).
18.
Bypaths in local tournaments.
J. Korean Math. Soc. 36: 431-445(1999). PDF
19.
ν-paths of arcs in regular multipartite tournaments.
Bull. Korean Math. Soc. 36: 389-394(1999). PDF
20.
A note on vertex pancyclic oriented graphs.
J. Graph Theory 31(4): 313-318(1999).
doi:10.1002/(SICI)1097-0118(199908)31:4<313::AID-JGT6>3.0.CO;2-C
21.
A new sufficient condition for a digraph to be Hamiltonian.
Discrete Appl. Math. 95(1-3): 61-72(1999).
22.
Outpaths in semicomplete multipartite digraphs.
Discrete Appl. Math. 95(1-3): 273-277(1999).
23.
Sufficient conditions for semicomplete multipartite digraphs to be hamiltonian.
Discrete Math. 212(1-2): 91-100(2000). PDF
24.
Pancyclic out-arcs of a vertex in tournaments.
Discrete Appl. Math. 99(1-3): 245-249(2000).
25.
Complementary cycles containing prescribed vertices in tournaments.
Discrete Math. 214(1-3): 77-87(2000).
26.
The cycle structure of regular multipartite tournaments.
Discrete Appl. Math. 120(1-3): 109-116(2002).
27.
Mit dem Zufall planan --- Eine neue Methode ermöglicht fundiertere Prognosen über die Entwicklung von Abfallmengen.
Müllmagazin 4: 18-24(2002).
28.
Extendable cycles in multipartite tournaments.
Graphs Combin. 20(2): 185-190(2004).
29.
Locally semicomplete digraph with a factor composed of k cycles.
J. Korean Math. Soc. 41: 895-912(2004).
30.
Characterization of edge-colored complete graphs with properly colored Hamilton paths.
J. Graph Theory 53(4): 333-346(2006).
31.
A local tournament contains a vertex whose out-arc are g-pancyclic.
CTW 2007: 99-102. PDF
32.
Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws.
Optimization 57: 135-141(2008).
33.
Hamiltonian problem on claw-free and almost distance-hereditary graphs.
Discrete Math. 308(24): 6558-6563(2008).
34.
A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic.
J. Graph Theory 62(4): 346-361(2009).
35.
Three supplements to Reid's theorem in multipartite tournaments.
Discrete Appl. Math. 158(4): 340-348(2010).
36.
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian.
Discrete Appl. Math. 158(4): 331-339(2010).
37.
Out-arc pancyclicity of vertices in tournaments.
Discrete Appl. Math. 158(9): 996-1005(2010).
38.
Cycles through arcs in multipartite tournaments and a conjecture of Volkmann.
Appl. Math. lett. 24(4): 412-415(2011).
39.
Weakly quasi-Hamiltonian-set-connected multipartite tournaments.
Discrete Appl. Math. 160(10-11): 1561-1566(2012).
40.
Comparison of Driving Patterns of Mail Trucks in Postal Artery Network.
ICIC Express Letters 3(6): 1429-1436(2012).
41.
Restricted arc-connectivity in tournaments.
Discrete Appl. Math. 161(10-11): 1467-1471(2013).
42.
Restricted arc-connectivity in bipartite tournaments.
Discrete Appl. Math. 161(13-14): 2008-2013(2013).
43.
Notes on vertex pancyclicity of graphs.
Inf. Process. Lett. 113(19-21): 710-713(2013).
44.
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs.
Discrete Math. 313(23): 2667-2672(2013).
45.
On the vertex-pancyclicity of hypertournaments.
Discrete Appl. Math. 161(16-17): 2749-2752(2013).
46.
Connectivity of local tournaments.
Australas. J. Combin. 57: 271-279(2013). PDF
47.
The H-force set of a hypertournament.
Discrete Appl. Math. 169: 168-175(2014).
48.
Signed cycle domination numbers of digraphs.
Ars Comb. 115: 425-433(2014).
49.
Pancyclic arcs in Hamiltonian cycles of hypertournaments.
J. Korean Math. Soc. 51: 1141-1154(2014).
50.
Pancyclic out-arcs of a vertex in a hypertournament.
Australas. J. Combin. 61: 227-250(2015). PDF
51.
Sufficient conditions for maximally k-isoperimetric edge connectivity of graphs.
Int. J. Found. Comput. Sci. 26(5): 583-598(2015).
52.
Conditional fault tolerance in a class of Cayley graphs.
Int. J. Comput. Math. 93(1): 67-82(2016).
53.
On pancyclic arcs in hypertournaments.
Discrete Appl. Math. 215: 164-170(2016).
54.
The 1-good-neighbour diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model.
Int. J. Comput. Math. 94(3): 620-631(2017).
55.
Universal arcs in local tournaments.
Discrete Math. 340: 2900-2915(2017).
56.
Oriented diameter of graphs with given maximum degree.
J. Graph Theory 88(1): 5-17(2018).
57.
Miscellaneous Digraph Classes.
In: Bang-Jensen J., Gutin G. (eds.) Classes of Directed Graphs. Springer, Cham (2018).
58.
t-pancyclic arcs in tournaments.
Commun. Comb. Optim. 4(2), 123-130(2018).
59.
Vertex-disjoint cycles in local tournaments.
Discrete Math. 343(12): 112127(2020).
60.
Oriented diameter of maximal outerplanar graphs.
J. Graph Theory 98(3): 426-444(2021).
61.
Spanning acyclic subdigraphs and strong t-panconnectivity of tournaments.
Discrete Appl. Math. 322: 9-19(2022).
62.
Minimum quasi_l-pancyclic multipartite tournaments.
Pure and Applied Functional Analysis, 8(4): 1093-1105(2023).
63.
Signed total Roman domination and domatic numbers in graphs.
Appl. Math. Comput. 487 (2025) 129074
64.
The oriented diameter of graphs derived from other graphs.
Discrete Math. 348(6) (2025) 114443
65.
Anti-pancyclic arcs in strong tournaments.
Applied Mathematics A Journal of Chinese Universities, to appear
66.
Total Italian domination in digraphs.
Discuss. Math. Graph Theory, submitted
67.
Quasi_nl-arc-pancyclic regular multipartite tournaments.
J. Graph Theory, submitted
68.
Signed total Italian domatic numbers of digraphs.
Discrete Appl. Math., submitted
69.
On the total Italian domination number in digraphs.
J. Comb. Optim., submitted