P. Dankelmann

activity

20082026

most citedBounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension

12 citations · 42 across the 21 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

3 papers · 2 filters

math.CO2018

A Size Condition for Diameter Two Orientable Graphs

Garner Cochran, Éva Czabarka, Peter Dankelmann +1

It was conjectured by Koh and Tay [Graphs Combin. 18(4) (2002), 745--756] that for $n \geq 5$ every simple graph of order $n$ and size at least $(2 n) - n + 5$ has an orientation…

math.CO2018

A degree condition for diameter two orientability of graphs

Éva Czabarka, Peter Dankelmann, László A. Székely

For $n \in N$ let $δ_{n}$ be the smallest value such that every graph of order $n$ and minimum degree at least $δ_{n}$ admits an orientation of diameter two. We show that $δ_n…

math.CO2018

The Steiner $k$ -Wiener index of graphs with given minimum degree

Peter Dankelmann

Let $G$ be a connected graph. The Steiner distance $d (S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$ . For $k\in \mat…

A Size Condition for Diameter Two Orientable Graphs

A degree condition for diameter two orientability of graphs

The Steiner k-Wiener index of graphs with given minimum degree

The Steiner $k$ -Wiener index of graphs with given minimum degree