Dankelmann, Peter On the Wiener index of orientations of graphs. (English) Zbl 1520.05025 Discrete Appl. Math. 336, 125-131 (2023). Reviewer: Rosário Fernandes (Lisboa) MSC: 05C09 05C12 05C20 05C92 92E10 PDFBibTeX XMLCite \textit{P. Dankelmann}, Discrete Appl. Math. 336, 125--131 (2023; Zbl 1520.05025) Full Text: DOI arXiv
Dankelmann, P. Size of graphs and digraphs with given diameter and connectivity constraints. (English) Zbl 1488.05153 Acta Math. Hung. 164, No. 1, 178-199 (2021). Reviewer: William G. Brown (Montréal) MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{P. Dankelmann}, Acta Math. Hung. 164, No. 1, 178--199 (2021; Zbl 1488.05153) Full Text: DOI
Dankelmann, Peter On average distance in tournaments and Eulerian digraphs. (English) Zbl 1476.05066 Discrete Appl. Math. 266, 38-47 (2019). MSC: 05C20 05C12 05C45 05C09 PDFBibTeX XMLCite \textit{P. Dankelmann}, Discrete Appl. Math. 266, 38--47 (2019; Zbl 1476.05066) Full Text: DOI
Dankelmann, Peter; Dorfling, Michael Diameter and maximum degree in Eulerian digraphs. (English) Zbl 1329.05126 Discrete Math. 339, No. 4, 1355-1361 (2016). MSC: 05C20 05C45 05C07 05C35 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{M. Dorfling}, Discrete Math. 339, No. 4, 1355--1361 (2016; Zbl 1329.05126) Full Text: DOI
Dankelmann, Peter Distance and size in digraphs. (English) Zbl 1301.05097 Discrete Math. 338, No. 1, 144-148 (2015). MSC: 05C12 05C20 05C35 PDFBibTeX XMLCite \textit{P. Dankelmann}, Discrete Math. 338, No. 1, 144--148 (2015; Zbl 1301.05097) Full Text: DOI
Dankelmann, Peter; Volkmann, L. The diameter of almost Eulerian digraphs. (English) Zbl 1204.05042 Electron. J. Comb. 17, No. 1, Research Paper R157, 11 p. (2010). MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, Electron. J. Comb. 17, No. 1, Research Paper R157, 11 p. (2010; Zbl 1204.05042) Full Text: EuDML EMIS
Dankelmann, Peter; Volkmann, Lutz Minimum size of a graph or digraph of given radius. (English) Zbl 1197.05076 Inf. Process. Lett. 109, No. 16, 971-973 (2009). MSC: 05C35 05C20 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, Inf. Process. Lett. 109, No. 16, 971--973 (2009; Zbl 1197.05076) Full Text: DOI
Dankelmann, P.; Volkmann, L. Average distance in bipartite tournaments. (English) Zbl 1174.05050 Ars Comb. 83, 295-306 (2007). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, Ars Comb. 83, 295--306 (2007; Zbl 1174.05050)
Dankelmann, P.; Volkmann, L. Average distance in \(k\)-connected tournaments. (English) Zbl 1164.05371 Ars Comb. 77, 289-294 (2005). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, Ars Comb. 77, 289--294 (2005; Zbl 1164.05371)
Dankelmann, Peter; Volkmann, Lutz Degree sequence conditions for maximally edge-connected graphs and digraphs. (English) Zbl 0879.05049 J. Graph Theory 26, No. 1, 27-34 (1997). Reviewer: Ján Plesník (Bratislava) MSC: 05C40 05C20 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{L. Volkmann}, J. Graph Theory 26, No. 1, 27--34 (1997; Zbl 0879.05049) Full Text: DOI