Cycles in Complementary Prisms of Bipartite Graphs
submitted
submitted for publication.
Realization of Integer Sequences by Graphs-with-Loops
submitted
submitted for publication.
Improvements for the Erdos-Posa Function of Long Cycles
submitted
submitted for publication.
The \(\{k\}\)-domatic number of a digraph
submitted
submitted for publication.
Local restricted edge-connectivity
submitted
submitted for publication.
Restricted edge-connectivity in graphs with bounded clique number or chromatic number
submitted
submitted for publication.
The Roman domatic number of digraphs
submitted
submitted for publication.
Forcing Brushes
published
arXiv:1801.00726 [math.CO].
Maximally edge-connected hypergraphs
published
Discrete Math 339 (2016), no. 1, 33-38.
The Roman bondage number of a digraph
published
Tamkang J. Math. 47 (2016), no. 4, 421-432.
Cycles avoiding a Color in Colorful Graphs
published
J. Graph Theory 81 (2016), no. 4, 342-350.
Robust recoverable perfect matchings
published
Networks 66 (2015), no. 3, 210-213.
Cycle Lengths of Hamiltonian \(P_{\ell}\)-free Graphs
published
Graphs Combin. 31 (2015), no. 6, 2335-2345.
Roman reinforcement number of digraphs
published
J. Combin. Math. Combin. Comput. 89 (2014), 53-64.
Upper bounds for the domination number in graphs of diameter two
published
Util. Math. 93 (2014), 267-277.
Maximally connected graphs
book chapter
Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge, 2013.
The Erdos-Posa Property for Long Circuits
published
Eurocomb, 2013, 19-24.
\(k\)-restricted edge-connectivity in triangle-free graphs
published
Discrete Appl. Math. 160 (2012), 1345-1355.
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
published
Discrete Appl. Math. 160 (2012), 1775-1781.
Nordhaus-Gaddum bound on the \(k\)-rainbow domatic number of a graph
published
Appl. Math. Lett. 24 (2011), 1758-1761.
Independence and k-domination in graphs
published
Int. J. Comput. Math. 88(5) (2011), 905-915.
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
published
J. Graph Theory 63(1) (2010), 82-92.
Local tournaments with the minimum numbers of Hamiltonian cycles or cycles of length three
published
Discrete Math. 310(13-14) (2010), 1940-1948.
Cycle factors in strongly connected local tournaments
published
Discrete Math. 310(4) (2010), 850-860.
A general method in the theory of domination in graphs
published
Int. J. Comput. Math. 87(13) (2010), 2915-2924.
The signed domatic number of some regular graphs
published
Discrete Appl. Math. 157(8) (2009), 1905-1912.
Complementary cycles in regular multipartite tournaments where one cycle has length five
published
Discrete Math. 309 (2009), 3131-3149.
published
J. Graph Theory 60(2) (2009), 130-148.
On the number of nonseparating vertices in strongly connected in-tournaments
published
Australas. J. Combin. 44 (2009), 123-152.
A remark on degree sequences of multigraphs
published
Math. Methods Oper. Res. 69(2) (2009), 369-374.
On arc-traceable local tournaments
published
Discrete Math. 308(24) (2008), 6513-6526.
All 2-connected in-tournaments that are cycle complementary
published
Discrete Math. 308(11) (2008), 2115-2133.
Restricted arc-connectivity of generalized tournaments
published
Australas. J. Combin. (2008), 269-278.
A remark on the \((2,2)\)-domination number
published
Discuss. Math. Graph Theory 28(2) (2008), 361-366.
Distance domination and distance irredundance in graphs
published
Electron. J. Combin. 14(1) (2007), Research Paper 35, 10pp. (electronic).
On the number of nonseparating vertices in local tournaments
published
Australas. J. Combin. 39 (2007), 301-315.
A lower bound for the distance \(k\)-domination number of trees
published
Results Math. 47(3-4) (2005), 335-339.
On Complementary Cycles in In-Tournament Digraphs
diploma thesis
RWTH Aachen University, 2004.
Erster Aachener Tag der Graphentheorie
proceedings
Tagungsband (2004).
Habilitation in Mathematics at Faculty of Mathematics and Economics of Ulm University.
PhD in Mathematics – Dr. rer. nat. – from RWTH Aachen University.
e: dated-667149798.klibo@dirkmeierling.eu (this address is automatically generated, and valid for one week)