Peter Dankelmann

	2009
35		Peter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart: On the degree distance of a graph. Discrete Applied Mathematics 157(13): 2773-2777 (2009)
34		Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On complexity of Minimum Leaf Out-Branching problem. Discrete Applied Mathematics 157(13): 3000-3004 (2009)
33		Peter Dankelmann, Lutz Volkmann: Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009)
	2008
32		Peter Dankelmann, Gregory Gutin, Eun Jung Kim: On Complexity of Minimum Leaf Out-branching Problem CoRR abs/0808.0980: (2008)
31		Peter Dankelmann, Gert Sabidussi: Embedding graphs as isometric medians. Discrete Applied Mathematics 156(12): 2420-2422 (2008)
30		Peter Dankelmann, Henda C. Swart, Paul van den Berg: Diameter and inverse degree. Discrete Mathematics 308(5-6): 670-673 (2008)
29		Peter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity II. SIAM J. Discrete Math. 21(4): 1035-1052 (2008)
28		Peter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity I. SIAM J. Discrete Math. 22(1): 92-101 (2008)
	2007
27		Peter Dankelmann, Lutz Volkmann: Average distance in bipartite tournaments. Ars Comb. 83: (2007)
26		Peter Dankelmann, Angelika Hellwig, Lutz Volkmann: On the connectivity of diamond-free graphs. Discrete Applied Mathematics 155(16): 2111-2117 (2007)
25		Peter Dankelmann, David P. Day, Johannes H. Hattingh, Michael A. Henning, Lisa R. Markus, Henda C. Swart: On equality in an upper bound for the restrained and total domination numbers of a graph. Discrete Mathematics 307(22): 2845-2852 (2007)
	2006
24		Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar: Simultaneous graph parameters: Factor domination and factor total domination. Discrete Mathematics 306(18): 2229-2233 (2006)
	2005
23		Peter Dankelmann, Lutz Volkmann: Average distance in k-connected tournaments. Ars Comb. 77: (2005)
22		Peter Dankelmann, Ortrud R. Oellermann: Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77: (2005)
21		Peter Dankelmann: The diameter of directed graphs. J. Comb. Theory, Ser. B 94(1): 183-186 (2005)
	2004
20		Peter Dankelmann, Neil J. Calkin: The Domatic Number of Regular Graphs. Ars Comb. 73: (2004)
19		Peter Dankelmann, Ortrud Oellermann, Jian-Liang Wu: Minimum average distance of strong orientations of graphs. Discrete Applied Mathematics 143(1-3): 204-212 (2004)
18		Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart: Maximum sizes of graphs with given domination parameters. Discrete Mathematics 281(1-3): 137-148 (2004)
17		Elias Dahlhaus, Peter Dankelmann, R. Ravi: A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89(5): 255-259 (2004)
	2003
16		Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart: Twin Domination in Digraphs. Ars Comb. 67: (2003)
15		Sheng Bau, Michael A. Henning, Peter Dankelmann: Average lower independence in trees and outerplanar graphs. Ars Comb. 69: (2003)
14		Peter Dankelmann, Ortrud Oellermann: Bounds on the average connectivity of a graph. Discrete Applied Mathematics 129(2-3): 305-318 (2003)
13		Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart: MAD trees and distance-hereditary graphs. Discrete Applied Mathematics 131(1): 151-167 (2003)
12		Peter Dankelmann, Renu C. Laskar: Factor domination and minimum degree. Discrete Mathematics 262(1-3): 113-119 (2003)
11		Peter Dankelmann, Henda C. Swart, David P. Day: On strong distances in oriented graphs. Discrete Mathematics 266(1-3): 195-201 (2003)
	2002
10		Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart: Augmenting trees so that every three vertices lie on a cycle. Discrete Applied Mathematics 116(1-2): 145-159 (2002)
9		Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Weighted domination in triangle-free graphs. Discrete Mathematics 250(1-3): 233-239 (2002)
	2000
8		Peter Dankelmann, Lutz Volkmann: Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Mathematics 211: 217-223 (2000)
7		Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Some results on graph parameters in weighted graphs. Electronic Notes in Discrete Mathematics 5: 85-88 (2000)
	1999
6		Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999)
	1997
5		Peter Dankelmann, Henda C. Swart, Ortrud Oellermann: On the Average Steiner Distance of Graphs with Prescribed Properties. Discrete Applied Mathematics 79(1-3): 91-103 (1997)
4		Peter Dankelmann: Average Distance and Domination Number. Discrete Applied Mathematics 80(1): 21-35 (1997)
	1994
3		Peter Dankelmann: Average Distance and Independence Number. Discrete Applied Mathematics 51(1-2): 75-83 (1994)
2		Peter Dankelmann, Thomas Niessen, Ingo Schiermeyer: On Path-Tough Graphs. SIAM J. Discrete Math. 7(4): 571-584 (1994)
	1993
1		Peter Dankelmann: Computing the Average Distance of an Interval Graph. Inf. Process. Lett. 48(6): 311-314 (1993)

Coauthor Index

1	Sheng Bau	[15]
2	Paul van den Berg	[30]
3	Neil J. Calkin	[20]
4	Gary Chartrand	[16]
5	Elias Dahlhaus	[13] [17]
6	David P. Day	[11] [25]
7	Gayla S. Domke	[18]
8	Wayne Goddard	[6] [10] [13] [18] [24]
9	Paul J. P. Grobler	[18]
10	Gregory Gutin	[32] [34]
11	I. Gutman	[35]
12	Johannes H. Hattingh	[18] [25]
13	Angelika Hellwig	[26]
14	Michael A. Henning	[6] [15] [24] [25]
15	Eun Jung Kim	[32] [34]
16	Renu Laskar (Renu C. Laskar)	[12] [24]
17	Lisa R. Markus	[25]
18	Simon Mukwembi	[28] [29] [35]
19	Thomas Niessen	[2]
20	Ortrud R. Oellermann (Ortrud Oellermann)	[5] [10] [14] [19] [22]
21	Dieter Rautenbach	[7] [9]
22	R. Ravi	[17]
23	Gert Sabidussi	[31]
24	Ingo Schiermeyer	[2]
25	Michelle Schultz	[16]
26	Henda C. Swart	[5] [6] [10] [11] [13] [16] [18] [25] [28] [29] [30] [35]
27	Lutz Volkmann	[7] [8] [9] [23] [26] [27] [33]
28	Jian-Liang Wu	[19]

Colors in the list of coauthors