On planar geodetic graphs
From MaRDI portal
Publication:5533014
Cited in
(26)- Enumeration of labeled geodetic graphs with small cyclomatic number
- Geodetic blocks of diameter three
- Further hardness results on rainbow and strong rainbow connectivity
- Geodetic graphs of diameter two
- A bound on the treewidth of planar even-hole-free graphs
- scientific article; zbMATH DE number 3993615 (Why is no real title available?)
- Some general constructions of geodetic blocks
- scientific article; zbMATH DE number 3931054 (Why is no real title available?)
- scientific article; zbMATH DE number 3773639 (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?)
- Graph theory (algorithmic, algebraic, and metric problems)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
- Leanness computation: small values and special graph classes
- A new upper bound on the number of edges in a geodetic graph
- Drawing Shortest Paths in Geodetic Graphs
- The second Riddell relation and its consequences
- A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
- On the connectivity and diameter of geodetic graphs
- Drawing Shortest Paths in Geodetic Graphs
- On graphs with unique geoodesics and antipodes
- Enumeration of labeled geodetic planar graphs
- Geodetic orientations of complete \(k\)-partite graphs
- Complexity of rainbow vertex connectivity problems for restricted graph classes
- Rewriting systems, plain groups, and geodetic graphs
- On the mutual visibility in Cartesian products and triangle-free graphs
This page was built for publication: On planar geodetic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5533014)
