Some general constructions of geodetic blocks
From MaRDI portal
Cites work
- 1-Factors and Antifactor Sets
- Geodetic graphs of diameter two
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3485845 (Why is no real title available?)
- scientific article; zbMATH DE number 3540829 (Why is no real title available?)
- scientific article; zbMATH DE number 3563180 (Why is no real title available?)
- scientific article; zbMATH DE number 3595217 (Why is no real title available?)
- scientific article; zbMATH DE number 3799681 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- On Moore Graphs with Diameters 2 and 3
- On planar geodetic graphs
Cited in
(11)- A new upper bound on the number of edges in a geodetic graph
- scientific article; zbMATH DE number 3931054 (Why is no real title available?)
- A note on 3-Steiner intervals and betweenness
- scientific article; zbMATH DE number 3993615 (Why is no real title available?)
- Drawing Shortest Paths in Geodetic Graphs
- Drawing Shortest Paths in Geodetic Graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
- Geodetic graphs: experiments and new constructions
- Geodetic blocks of diameter three
- An extremal problem in geodetic graphs
This page was built for publication: Some general constructions of geodetic blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165873)
