Largest planar graphs of diameter two and fixed maximum degree
From MaRDI portal
Recommendations
Cites work
Cited in
(34)- Largest planar graphs and largest maximal planar graphs of diameter two
- Dynamic coloring parameters for graphs with given genus
- Large planar graphs with given diameter and maximum degree
- Structure and pancyclicity of maximal planar graphs with diameter two
- List coloring and diagonal coloring for plane graphs of diameter two
- The degree-diameter problem for outerplanar graphs
- A unified approach to distance-two colouring of graphs on surfaces
- Distance-two coloring of sparse graphs
- On the maximum order of graphs embedded in surfaces
- Largest Graphs of Diameter 2 and Maximum Degree 6
- New constructions of large scale planar networks with given diameter and maximum degree
- scientific article; zbMATH DE number 3987312 (Why is no real title available?)
- scientific article; zbMATH DE number 4004216 (Why is no real title available?)
- scientific article; zbMATH DE number 4023313 (Why is no real title available?)
- Constructions of large planar networks with given degree and diameter
- Steiner diameter of 3, 4 and 5-connected maximal planar graphs
- scientific article; zbMATH DE number 1892890 (Why is no real title available?)
- The degree-diameter problem for sparse graph classes
- Plane graphs with large faces and small diameter
- An introduction to the discharging method via graph coloring
- Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface
- Maximum size of a planar graph with given degree and diameter
- Combinatorial Geometry and Graph Theory
- Largest Graphs of Diameter 2 and Maximum Degree 6
- The degree/diameter problem in maximal planar bipartite graphs
- The degree/diameter problem in maximal planar bipartite graphs
- Coloring the square of maximal Planar graphs with diameter two
- Quantum routing in planar graph using perfect state transfer
- Bounding clique size in squares of planar graphs
- Existential closure in line graphs
- Maximum size of a planar graph with given degree and even diameter
- The degree-diameter problem for plane graphs with pentagonal faces
- Covering planar graphs with a fixed number of balls
- Classification of regular planar graphs with diameter two
This page was built for publication: Largest planar graphs of diameter two and fixed maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686482)