Dirk Meierling

Publication Activity (10 Years)

Years Active: 2007-2019
Publications (10 Years): 3

Top Topics

Color Quantization

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Dirk Meierling, Dieter Rautenbach
Forcing brushes. Discret. Appl. Math. 257 (2019)
Peter Dankelmann, Dirk Meierling
Maximally edge-connected hypergraphs. Discret. Math. 339 (1) (2016)
Dirk Meierling, Janina Müttel, Dieter Rautenbach
Cycles Avoiding a Color in Colorful Graphs. J. Graph Theory 81 (4) (2016)
Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida
Robust recoverable perfect matchings. Networks 66 (3) (2015)
Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida
Cycles in complementary prisms. Discret. Appl. Math. 193 (2015)
Dirk Meierling, Dieter Rautenbach
-free Graphs. Graphs Comb. 31 (6) (2015)
Dirk Meierling, Dieter Rautenbach, Thomas Sasse
The Erdős-Pósa Property for Long Circuits. J. Graph Theory 77 (4) (2014)
Dirk Meierling, Lutz Volkmann
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. Discret. Appl. Math. 160 (12) (2012)
Andreas Holtkamp, Dirk Meierling, Luis Pedro Montejano
k-restricted edge-connectivity in triangle-free graphs. Discret. Appl. Math. 160 (9) (2012)
Dirk Meierling, Seyed Mahmoud Sheikholeslami, Lutz Volkmann
Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph. Appl. Math. Lett. 24 (10) (2011)
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
-domination in graphs. Int. J. Comput. Math. 88 (5) (2011)
Dirk Meierling
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three. Discret. Math. 310 (13-14) (2010)
Dirk Meierling, Lutz Volkmann
Cycle factors in strongly connected local tournaments. Discret. Math. 310 (4) (2010)
Dirk Meierling
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments. J. Graph Theory 63 (1) (2010)
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
A general method in the theory of domination in graphs. Int. J. Comput. Math. 87 (13) (2010)
Dirk Meierling, Lutz Volkmann
A remark on degree sequences of multigraphs. Math. Methods Oper. Res. 69 (2) (2009)
Dirk Meierling
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments. J. Graph Theory 60 (2) (2009)
Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen
Complementary cycles in regular multipartite tournaments, where one cycle has length five. Discret. Math. 309 (10) (2009)
Dirk Meierling
On the number of nonseparating vertices in strongly connected in-tournaments. Australas. J Comb. 44 (2009)
Dirk Meierling, Lutz Volkmann, Stephan Zitzen
The signed domatic number of some regular graphs. Discret. Appl. Math. 157 (8) (2009)
Dirk Meierling, Lutz Volkmann
On the number of cycles in local tournaments. Discret. Math. 309 (8) (2009)
Dirk Meierling, Lutz Volkmann
All 2-connected in-tournaments that are cycle complementary. Discret. Math. 308 (11) (2008)
Torsten Korneffel, Dirk Meierling, Lutz Volkmann
A remark on the (2, 2)-domination number. Discuss. Math. Graph Theory 28 (2) (2008)
Dirk Meierling, Lutz Volkmann
On arc-traceable local tournaments. Discret. Math. 308 (24) (2008)
Dirk Meierling, Lutz Volkmann, Stefan Winzen
Restricted arc-connectivity of generalized tournaments. Australas. J Comb. 40 (2008)
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
Distance Domination and Distance Irredundance in Graphs. Electron. J. Comb. 14 (1) (2007)
Dirk Meierling, Lutz Volkmann
On the number of nonseparating vertices in strongly connected local tournaments. Australas. J Comb. 39 (2007)