Dipl.-Math. Michel Surmacs
Postal Address
RWTH Aachen University
Chair of Mathematics of Information Processing
Attn: Dipl.-Math. Michel Surmacs
Pontdriesch 10
52062 Aachen
Germany
Contact Options and Office Hours
Office: Room 201, Pontdriesch 10
Phone: +49 241 80-96961
Fax: +49 241 80-99267
E-mail: surmacs@mathc.rwth-aachen.de
Office Hours:
on appointment
Publications
13.
Miscellaneous Digraph Classes
In: Bang-Jensen J., Gutin G. (eds) Classes of Directed Graphs. Springer Monographs in Mathematics. Springer, Cham (2018)
12.
Oriented diameter of graphs with given maximum degree
J. Graph Theory 88 (2018), 5-17
11.
Improved bound on the oriented diameter of graphs with given minimum degree
European J. Combin. 79 (2017), 187-191
10.
Regular hypertournaments and arc-pancyclicity
J. Graph Theory 84 (2016), 176-190
9.
Weakly quasi-Hamiltonian-connected multipartite tournaments
Discrete Mathematics 339 (2016), 597-605
8.
Pancyclic out-arcs of a vertex in a hypertournament
The Australasian Journal of Combinatorics 61 (2015), 227-250 PDF
7.
Quasi-Hamiltonian cycles in k-strong multipartite tournaments
Discrete Applied Mathematics 184 (2015), 253-257
6.
The number of pancyclic arcs contained in a Hamiltonian cycle of a tournament
Bulletin of the Korean Mathematical Society 51 (2014), 1649-1654
5.
Pancyclic arcs in Hamiltonian cycles of hypertournaments
Journal of the Korean Mathematical Society 51 (2014), 1141-1154
4.
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs
Discrete Mathematics 313 (2013), 2667-2672
3.
On the vertex-pancyclicity of hypertournaments
Discrete Applied Mathematics 161 (2013), 2749-2752
2.
Weakly quasi-Hamiltonian-set-connected multipartite tournaments
Discrete Applied Mathematics 160 (2012), 1561-1566
1.
On set colorings of complete bipartite graphs
The Australasian Journal of Combinatorics 49 (2011), 245-253 PDF