Constructions of large planar networks with given degree and diameter
From MaRDI portal
Publication:4540082
DOI<275::AID-NET4>3.0.CO;2-G 10.1002/(SICI)1097-0037(199812)32:4<275::AID-NET4>3.0.CO;2-GzbMath1002.90008OpenAlexW2067866460MaRDI QIDQ4540082
Karen Seyffarth, Michael R. Fellows, Pavol Hell
Publication date: 21 July 2002
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199812)32:4<275::aid-net4>3.0.co;2-g
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)
Related Items (8)
On the maximum order of graphs embedded in surfaces ⋮ Maximum size of a planar graph with given degree and diameter ⋮ Large planar graphs with given diameter and maximum degree ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Maximum size of a planar graph with given degree and even diameter ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ The degree-diameter problem for sparse graph classes ⋮ Constructions of large graphs on surfaces
This page was built for publication: Constructions of large planar networks with given degree and diameter
