On planar geodetic graphs

DOI10.1016/S0021-9800(68)80035-3zbMath0153.54004MaRDI QIDQ5533014

Mark E. Watkins, Joel G. Stemple

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (25)

Drawing Shortest Paths in Geodetic Graphs ⋮ Unnamed Item ⋮ A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs ⋮ Enumeration of labeled geodetic graphs with small cyclomatic number ⋮ Unnamed Item ⋮ On the connectivity and diameter of geodetic graphs ⋮ On graphs with unique geoodesics and antipodes ⋮ Further hardness results on rainbow and strong rainbow connectivity ⋮ Some general constructions of geodetic blocks ⋮ Complexity of rainbow vertex connectivity problems for restricted graph classes ⋮ Unnamed Item ⋮ Geodetic graphs of diameter two ⋮ Unnamed Item ⋮ A bound on the treewidth of planar even-hole-free graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares ⋮ The Second Riddell Relation and Its Consequences ⋮ Geodetic blocks of diameter three ⋮ Rewriting systems, plain groups, and geodetic graphs ⋮ Geodetic orientations of complete \(k\)-partite graphs ⋮ A new upper bound on the number of edges in a geodetic graph ⋮ On the mutual visibility in Cartesian products and triangle-free graphs ⋮ Unnamed Item ⋮ Drawing Shortest Paths in Geodetic Graphs ⋮ Enumeration of labeled geodetic planar graphs

This page was built for publication: On planar geodetic graphs