The following pages link to On planar geodetic graphs (Q5533014):
Displayed 25 items.
- Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs (Q595678) (← links)
- Geodetic blocks of diameter three (Q759769) (← links)
- Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
- A bound on the treewidth of planar even-hole-free graphs (Q987668) (← links)
- Some general constructions of geodetic blocks (Q1165873) (← links)
- A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares (Q1244252) (← links)
- A new upper bound on the number of edges in a geodetic graph (Q1301713) (← links)
- Geodetic orientations of complete \(k\)-partite graphs (Q1844242) (← links)
- Rewriting systems, plain groups, and geodetic graphs (Q2072071) (← links)
- On the mutual visibility in Cartesian products and triangle-free graphs (Q2096353) (← links)
- Enumeration of labeled geodetic planar graphs (Q2352579) (← links)
- Enumeration of labeled geodetic graphs with small cyclomatic number (Q2401642) (← links)
- (Q3705483) (← links)
- (Q3953797) (← links)
- (Q4068756) (← links)
- (Q4116463) (← links)
- (Q4722092) (← links)
- The Second Riddell Relation and Its Consequences (Q4973239) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5014127) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5050002) (← links)
- Geodetic graphs of diameter two (Q5905792) (← links)
- On the connectivity and diameter of geodetic graphs (Q6189693) (← links)
- On graphs with unique geoodesics and antipodes (Q6197732) (← links)