Maximal outerplane graphs of extremal diameter
From MaRDI portal
Recommendations
Cites work
- Computation of the center and diameter of outerplanar graphs
- scientific article; zbMATH DE number 4137792 (Why is no real title available?)
- scientific article; zbMATH DE number 1191218 (Why is no real title available?)
- scientific article; zbMATH DE number 1285528 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
- On the vertex separation of maximal outerplanar graphs
- Separating subgraphs in k-trees: Cables and caterpillars
- The Wiener index of maximal outerplane graphs
Cited in
(7)- Largest planar graphs and largest maximal planar graphs of diameter two
- scientific article; zbMATH DE number 6096647 (Why is no real title available?)
- scientific article; zbMATH DE number 3857141 (Why is no real title available?)
- scientific article; zbMATH DE number 3875306 (Why is no real title available?)
- scientific article; zbMATH DE number 3878973 (Why is no real title available?)
- scientific article; zbMATH DE number 1439428 (Why is no real title available?)
- Extremal by Wiener index maximal outerplane graphs with two simplicial vertices
This page was built for publication: Maximal outerplane graphs of extremal diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4999722)