On planar geodetic graphs

DOI10.1016/S0021-9800(68)80035-3zbMATH Open0153.54004MaRDI QIDQ5533014FDOQ5533014

Mark E. Watkins, Joel G. Stemple

Publication date: 1968

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

zbMATH Keywords

topology

Cited In (26)

• The Second Riddell Relation and Its Consequences
• Enumeration of labeled geodetic graphs with small cyclomatic number
• Geodetic graphs of diameter two
• Geodetic blocks of diameter three
• Further hardness results on rainbow and strong rainbow connectivity
• A bound on the treewidth of planar even-hole-free graphs
• Title not available (Why is that?)
• Some general constructions of geodetic blocks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• On the connectivity and diameter of geodetic graphs
• A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
• 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
• Rewriting systems, plain groups, and geodetic graphs
• Complexity of rainbow vertex connectivity problems for restricted graph classes
• 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)