On the number of nonseparating vertices in strongly connected local tournaments. - Dirk Meierling; Lutz Volkmann (Australas. J Comb., 2007)

Distance Domination and Distance Irredundance in Graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Electron. J. Comb., 2007)

Restricted arc-connectivity of generalized tournaments. - Dirk Meierling; Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2008)

All 2-connected in-tournaments that are cycle complementary. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2008)

On arc-traceable local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2008)

A remark on the (2, 2)-domination number. - Torsten Korneffel; Dirk Meierling; Lutz Volkmann (Discuss. Math. Graph Theory, 2008)

On the number of nonseparating vertices in strongly connected in-tournaments. - Dirk Meierling (Australas. J Comb., 2009)

The signed domatic number of some regular graphs. - Dirk Meierling; Lutz Volkmann; Stephan Zitzen (Discret. Appl. Math., 2009)

Complementary cycles in regular multipartite tournaments, where one cycle has length five. - Zhihong He; Torsten Korneffel; Dirk Meierling; Lutz Volkmann; Stefan Winzen (Discret. Math., 2009)

On the number of cycles in local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2009)

Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments. - Dirk Meierling (J. Graph Theory, 2009)

A remark on degree sequences of multigraphs. - Dirk Meierling; Lutz Volkmann (Math. Methods Oper. Res., 2009)

Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three. - Dirk Meierling (Discret. Math., 2010)

Cycle factors in strongly connected local tournaments. - Dirk Meierling; Lutz Volkmann (Discret. Math., 2010)

A general method in the theory of domination in graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Int. J. Comput. Math., 2010)

Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments. - Dirk Meierling (J. Graph Theory, 2010)

Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph. - Dirk Meierling; Seyed Mahmoud Sheikholeslami; Lutz Volkmann (Appl. Math. Lett., 2011)

Independence and k-domination in graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Int. J. Comput. Math., 2011)

k-restricted edge-connectivity in triangle-free graphs. - Andreas Holtkamp; Dirk Meierling; Luis Pedro Montejano 001 (Discret. Appl. Math., 2012)

Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. - Dirk Meierling; Lutz Volkmann (Discret. Appl. Math., 2012)

The Erdős-Pósa Property for Long Circuits. - Dirk Meierling; Dieter Rautenbach; Thomas Sasse (J. Graph Theory, 2014)

Cycles in complementary prisms. - Dirk Meierling; Fábio Protti; Dieter Rautenbach; Aline Ribeiro de Almeida (Discret. Appl. Math., 2015)

Cycle Lengths of Hamiltonian Pℓ-free Graphs. - Dirk Meierling; Dieter Rautenbach (Graphs Comb., 2015)

Robust recoverable perfect matchings. - Mitre Costa Dourado; Dirk Meierling; Lucia Draque Penso; Dieter Rautenbach; Fábio Protti; Aline Ribeiro de Almeida (Networks, 2015)

Maximally edge-connected hypergraphs. - Peter Dankelmann; Dirk Meierling (Discret. Math., 2016)

Cycles Avoiding a Color in Colorful Graphs. - Dirk Meierling; Janina Müttel; Dieter Rautenbach (J. Graph Theory, 2016)

Forcing brushes. - Dirk Meierling; Dieter Rautenbach (Discret. Appl. Math., 2019)