Large planar graphs with given diameter and maximum degree
From MaRDI portal
Publication:1897359
Recommendations
- Largest planar graphs of diameter two and fixed maximum degree
- Largest planar graphs and largest maximal planar graphs of diameter two
- Maximum size of a planar graph with given degree and even diameter
- scientific article; zbMATH DE number 1932947
- New constructions of large scale planar networks with given diameter and maximum degree
Cites work
Cited in
(29)- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Structure and pancyclicity of maximal planar graphs with diameter two
- Domination in planar graphs with small diameter*
- scientific article; zbMATH DE number 1892890 (Why is no real title available?)
- On the maximum order of graphs embedded in surfaces
- Largest planar graphs of diameter two and fixed maximum degree
- Largest planar graphs and largest maximal planar graphs of diameter two
- Domination and dominator colorings in planar graphs with small diameter
- Maximum size of a planar graph with given degree and diameter
- Large circulant graphs of fixed diameter and arbitrary degree
- Large graphs with given degree and diameter. II
- New Moore-like bounds and some optimal families of abelian Cayley mixed graphs
- The degree-diameter problem for outerplanar graphs
- Existential closure in line graphs
- The maximum sum of degrees above a threshold in planar graphs
- New constructions of large scale planar networks with given diameter and maximum degree
- Some large graphs with given degree and diameter
- Combinatorial Geometry and Graph Theory
- Classification of regular planar graphs with diameter two
- An improved Moore bound and some new optimal families of mixed abelian Cayley graphs
- The degree-diameter problem for sparse graph classes
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- scientific article; zbMATH DE number 1932947 (Why is no real title available?)
- The degree/diameter problem for mixed abelian Cayley graphs
- Constructions of large planar networks with given degree and diameter
- \(N\)-separators in planar graphs
- Maximum size of a planar graph with given degree and even diameter
- Plane graphs with large faces and small diameter
This page was built for publication: Large planar graphs with given diameter and maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1897359)