Largest planar graphs of diameter $3$ and fixed maximum degree -- connection with fractional matchings

Antoine Dailly, Sasha Darmon, Ugo Giocanti +2

The degree diameter problem asks for the maximum possible number of vertices in a graph of maximum degree $\hat{I}”$ and diameter $D$. In this paper, we focus on planar graphs of diamete…