dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Peter Dankelmann Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: Average distance in weighted graphs. Discrete Mathematics 312(1): 12-20 (2012)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, David Erwin, Simon Mukwembi, B. G. Rodrigues, Eric Mwambene, Gert Sabidussi: Automorphism group and diameter of a graph. Journal of Graph Theory 70(1): 80-91 (2012)
2011
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: On the distance distribution of trees. Discrete Applied Mathematics 159(10): 945-952 (2011)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAleksandar Ilic, Dragan Stevanovic, Lihua Feng, Guihai Yu, Peter Dankelmann: Degree distance of unicyclic and bicyclic graphs. Discrete Applied Mathematics 159(8): 779-788 (2011)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Henda C. Swart, Paul van den Berg: The number of edges in a bipartite graph of given radius. Discrete Mathematics 311(8-9): 690-698 (2011)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Bullock, Peter Dankelmann, Marietjie Frick, Michael A. Henning, Ortrud R. Oellermann, Susan A. van Aardt: Hamiltonicity of k-Traceable Graphs. Electr. J. Comb. 18(1): (2011)
2010
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: Average distance and generalised packing in graphs. Discrete Mathematics 310(17-18): 2334-2344 (2010)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: The Diameter of Almost Eulerian Digraphs. Electr. J. Comb. 17(1): (2010)
2009
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart: On the degree distance of a graph. Discrete Applied Mathematics 157(13): 2773-2777 (2009)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Gregory Gutin, Eun Jung Kim: On complexity of Minimum Leaf Out-Branching problem. Discrete Applied Mathematics 157(13): 3000-3004 (2009)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, I. Gutman, Simon Mukwembi, Henda C. Swart: The edge-Wiener index of a graph. Discrete Mathematics 309(10): 3452-3457 (2009)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart: Domination with exponential decay. Discrete Mathematics 309(19): 5877-5883 (2009)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Angelika Hellwig, Lutz Volkmann: Inverse degree and edge-connectivity. Discrete Mathematics 309(9): 2943-2947 (2009)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLÉva Czabarka, Peter Dankelmann, László A. Székely: Diameter of 4-colourable graphs. Eur. J. Comb. 30(5): 1082-1089 (2009)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Minimum size of a graph or digraph of given radius. Inf. Process. Lett. 109(16): 971-973 (2009)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Simon Mukwembi, Henda C. Swart: Average distance and vertex-connectivity. Journal of Graph Theory 62(2): 157-177 (2009)
2008
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Gregory Gutin, Eun Jung Kim: On Complexity of Minimum Leaf Out-branching Problem CoRR abs/0808.0980: (2008)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Gert Sabidussi: Embedding graphs as isometric medians. Discrete Applied Mathematics 156(12): 2420-2422 (2008)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Henda C. Swart, Paul van den Berg: Diameter and inverse degree. Discrete Mathematics 308(5-6): 670-673 (2008)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity II. SIAM J. Discrete Math. 21(4): 1035-1052 (2008)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Simon Mukwembi, Henda C. Swart: Average Distance and Edge-Connectivity I. SIAM J. Discrete Math. 22(1): 92-101 (2008)
2007
27no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Average distance in bipartite tournaments. Ars Comb. 83: (2007)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Angelika Hellwig, Lutz Volkmann: On the connectivity of diamond-free graphs. Discrete Applied Mathematics 155(16): 2111-2117 (2007)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Average distance in k-connected tournaments. Ars Comb. 77: (2005)
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Ortrud R. Oellermann: Degree Sequences of Optimally Edge-Connected Multigraphs. Ars Comb. 77: (2005)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: The diameter of directed graphs. J. Comb. Theory, Ser. B 94(1): 183-186 (2005)
2004
20no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Neil J. Calkin: The Domatic Number of Regular Graphs. Ars Comb. 73: (2004)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Ortrud Oellermann, Jian-Liang Wu: Minimum average distance of strong orientations of graphs. Discrete Applied Mathematics 143(1-3): 204-212 (2004)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias 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
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart: Twin Domination in Digraphs. Ars Comb. 67: (2003)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSheng Bau, Michael A. Henning, Peter Dankelmann: Average lower independence in trees and outerplanar graphs. Ars Comb. 69: (2003)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Ortrud Oellermann: Bounds on the average connectivity of a graph. Discrete Applied Mathematics 129(2-3): 305-318 (2003)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart: MAD trees and distance-hereditary graphs. Discrete Applied Mathematics 131(1): 151-167 (2003)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Renu C. Laskar: Factor domination and minimum degree. Discrete Mathematics 262(1-3): 113-119 (2003)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Henda C. Swart, David P. Day: On strong distances in oriented graphs. Discrete Mathematics 266(1-3): 195-201 (2003)
2002
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Weighted domination in triangle-free graphs. Discrete Mathematics 250(1-3): 233-239 (2002)
2000
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Lutz Volkmann: Degree sequence conditions for maximally edge-connected graphs depending on the clique number. Discrete Mathematics 211: 217-223 (2000)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Dieter Rautenbach, Lutz Volkmann: Some results on graph parameters in weighted graphs. Electronic Notes in Discrete Mathematics 5: 85-88 (2000)
1999
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999)
1997
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: Average Distance and Domination Number. Discrete Applied Mathematics 80(1): 21-35 (1997)
1994
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: Average Distance and Independence Number. Discrete Applied Mathematics 51(1-2): 75-83 (1994)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Thomas Niessen, Ingo Schiermeyer: On Path-Tough Graphs. SIAM J. Discrete Math. 7(4): 571-584 (1994)
1993
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann: Computing the Average Distance of an Interval Graph. Inf. Process. Lett. 48(6): 311-314 (1993)

Coauthor Index

1Susan A. van Aardt [43]
2Sheng Bau [15]
3Paul van den Berg [30] [44]
4Frank Bullock [43]
5Neil J. Calkin [20]
6Gary Chartrand [16]
7Éva Czabarka [35]
8Elias Dahlhaus [13] [17]
9David P. Day [11] [25] [37]
10Gayla S. Domke [18]
11David Erwin [37] [47]
12Lihua Feng [45]
13Marietjie Frick [43]
14Wayne Goddard [6] [10] [13] [18] [24]
15Paul J. P. Grobler [18]
16Gregory Gutin [32] [39]
17I. Gutman [38] [40]
18Johannes H. Hattingh [18] [25]
19Angelika Hellwig [26] [36]
20Michael A. Henning [6] [15] [24] [25] [43]
21Aleksandar Ilic [45]
22Eun Jung Kim [32] [39]
23Renu Laskar (Renu C. Laskar) [12] [24]
24Lisa R. Markus [25]
25Simon Mukwembi [28] [29] [33] [37] [38] [40] [47]
26Eric Mwambene [47]
27Thomas Niessen [2]
28Ortrud R. Oellermann (Ortrud Oellermann) [5] [10] [14] [19] [22] [43]
29Dieter Rautenbach [7] [9]
30R. Ravi [17]
31B. G. Rodrigues [47]
32Gert Sabidussi [31] [47]
33Ingo Schiermeyer [2]
34Michelle Schultz [16]
35Dragan Stevanovic [45]
36Henda C. Swart [5] [6] [10] [11] [13] [16] [18] [25] [28] [29] [30] [33] [37] [38] [40] [44]
37László A. Székely [35]
38Lutz Volkmann [7] [8] [9] [23] [26] [27] [34] [36] [41]
39Jian-Liang Wu [19]
40Guihai Yu [45]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page