default search action
Michael Dorfling
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j15]Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs. Discret. Appl. Math. 217: 506-511 (2017) - 2016
- [j14]Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs II. Discret. Math. 339(3): 1180-1188 (2016) - [j13]Peter Dankelmann, Michael Dorfling:
Diameter and maximum degree in Eulerian digraphs. Discret. Math. 339(4): 1355-1361 (2016) - 2014
- [j12]Michael Dorfling, Michael A. Henning:
Linear hypergraphs with large transversal number and maximum degree two. Eur. J. Comb. 36: 231-236 (2014) - 2013
- [j11]Izak Broere, Michael Dorfling:
The property of kk-colourable graphs is uniquely decomposable. Discret. Math. 313(19): 1961-1964 (2013) - 2012
- [j10]Michael Dorfling:
Some results on decomposable and reducible graph properties. Discret. Math. 312(16): 2491-2497 (2012) - [j9]Michael Dorfling, Samantha Dorfling:
Recognizable colorings of cycles and trees. Discuss. Math. Graph Theory 32(1): 81-90 (2012) - [j8]Michael Dorfling, Johan Meyer:
On Polynomials and Divisibility. Am. Math. Mon. 119(6): 502-506 (2012)
2000 – 2009
- 2006
- [j7]Michael Dorfling, Wayne Goddard, Michael A. Henning:
Domination in Planar Graphs with Small Diameter II. Ars Comb. 78 (2006) - [j6]Michael Dorfling, Michael A. Henning:
A note on power domination in grid graphs. Discret. Appl. Math. 154(6): 1023-1027 (2006) - [j5]Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt:
Construction of trees and graphs with equal domination parameters. Discret. Math. 306(21): 2647-2654 (2006) - 2005
- [j4]Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning:
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discret. Math. 300(1-3): 82-90 (2005) - 2002
- [j3]Michael Dorfling, Samantha Dorfling:
Generalized edge-chromatic numbers and additive hereditary properties of graphs. Discuss. Math. Graph Theory 22(2): 349-359 (2002) - 2000
- [j2]Izak Broere, Michael Dorfling:
The decomposability of additive hereditary properties of graphs. Discuss. Math. Graph Theory 20(2): 281-291 (2000)
1990 – 1999
- 1998
- [j1]Izak Broere, Michael Dorfling, Jean E. Dunbar, Marietjie Frick:
A path(ological) partition problem. Discuss. Math. Graph Theory 18(1): 113-125 (1998)
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-24 23:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint