Dirk Meierling

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