The Degree/Diameter Problem in Maximal Planar Bipartite graphs

Electronic Journal Of Combinatorics

Cristina Dalfó¹ 

关键词: Degree/Diameter Problem;    Planar graphs;    Bipartite graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

The $(\Delta,D)$ (degree/diameter) problem consists of finding the largest possible number of vertices $n$ among all the graphs with maximum degree $\Delta$ and diameter $D$. We consider the $(\Delta,D)$ problem for maximal planar bipartite graphs, that i

【 授权许可】

Others