default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDirk Meierling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j27]Dirk Meierling, Dieter Rautenbach:
Forcing brushes. Discret. Appl. Math. 257: 359-360 (2019)- 2016
- [j26]Peter Dankelmann
, Dirk Meierling:
Maximally edge-connected hypergraphs. Discret. Math. 339(1): 33-38 (2016) - [j25]Dirk Meierling, Janina Müttel, Dieter Rautenbach:
Cycles Avoiding a Color in Colorful Graphs. J. Graph Theory 81(4): 342-350 (2016) - 2015
- [j24]Dirk Meierling, Fábio Protti, Dieter Rautenbach, Aline Ribeiro de Almeida:
Cycles in complementary prisms. Discret. Appl. Math. 193: 180-186 (2015) - [j23]Dirk Meierling, Dieter Rautenbach:
Cycle Lengths of Hamiltonian Pℓ-free Graphs. Graphs Comb. 31(6): 2335-2345 (2015) - [j22]Mitre Costa Dourado, Dirk Meierling, Lucia Draque Penso, Dieter Rautenbach, Fábio Protti, Aline Ribeiro de Almeida:
Robust recoverable perfect matchings. Networks 66(3): 210-213 (2015) - 2014
- [j21]Dirk Meierling, Dieter Rautenbach, Thomas Sasse:
The Erdős-Pósa Property for Long Circuits. J. Graph Theory 77(4): 251-259 (2014) - 2012
- [j20]Andreas Holtkamp, Dirk Meierling, Luis Pedro Montejano:
k-restricted edge-connectivity in triangle-free graphs. Discret. Appl. Math. 160(9): 1345-1355 (2012) - [j19]Dirk Meierling, Lutz Volkmann:
Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected. Discret. Appl. Math. 160(12): 1775-1781 (2012) - 2011
- [j18]Dirk Meierling, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
Nordhaus-Gaddum bounds on the k-rainbow domatic number of a graph. Appl. Math. Lett. 24(10): 1758-1761 (2011) - [j17]Adriana Hansberg, Dirk Meierling, Lutz Volkmann:
Independence and k-domination in graphs. Int. J. Comput. Math. 88(5): 905-915 (2011) - 2010
- [j16]Dirk Meierling, Lutz Volkmann:
Cycle factors in strongly connected local tournaments. Discret. Math. 310(4): 850-860 (2010) - [j15]Dirk Meierling:
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three. Discret. Math. 310(13-14): 1940-1948 (2010) - [j14]Adriana Hansberg, Dirk Meierling, Lutz Volkmann:
A general method in the theory of domination in graphs. Int. J. Comput. Math. 87(13): 2915-2924 (2010) - [j13]Dirk Meierling:
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments. J. Graph Theory 63(1): 82-92 (2010)
2000 – 2009
- 2009
- [j12]Dirk Meierling:
On the number of nonseparating vertices in strongly connected in-tournaments. Australas. J Comb. 44: 123-152 (2009) - [j11]Dirk Meierling, Lutz Volkmann, Stephan Zitzen:
The signed domatic number of some regular graphs. Discret. Appl. Math. 157(8): 1905-1912 (2009) - [j10]Dirk Meierling, Lutz Volkmann:
On the number of cycles in local tournaments. Discret. Math. 309(8): 2042-2052 (2009) - [j9]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): 3131-3149 (2009) - [j8]Dirk Meierling:
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments. J. Graph Theory 60(2): 130-148 (2009) - [j7]Dirk Meierling, Lutz Volkmann:
A remark on degree sequences of multigraphs. Math. Methods Oper. Res. 69(2): 369-374 (2009) - 2008
- [j6]Dirk Meierling, Lutz Volkmann, Stefan Winzen:
Restricted arc-connectivity of generalized tournaments. Australas. J Comb. 40: 269-278 (2008) - [j5]Dirk Meierling, Lutz Volkmann:
All 2-connected in-tournaments that are cycle complementary. Discret. Math. 308(11): 2115-2133 (2008) - [j4]Dirk Meierling, Lutz Volkmann:
On arc-traceable local tournaments. Discret. Math. 308(24): 6513-6526 (2008) - [j3]Torsten Korneffel, Dirk Meierling, Lutz Volkmann:
A remark on the (2, 2)-domination number. Discuss. Math. Graph Theory 28(2): 361-366 (2008) - 2007
- [j2]Dirk Meierling, Lutz Volkmann:
On the number of nonseparating vertices in strongly connected local tournaments. Australas. J Comb. 39: 301- (2007) - [j1]Adriana Hansberg, Dirk Meierling, Lutz Volkmann:
Distance Domination and Distance Irredundance in Graphs. Electron. J. Comb. 14(1) (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
