Bigeodetic graphs

DOI10.1007/BF01864174zbMath0657.05064OpenAlexW2913444680MaRDI QIDQ1110539

S. H. Smith

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864174

zbMATH Keywords

blockconnectivitygirthperfect graphbigeodetic graphsdistance pathGeodetic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (2)

On k-geodetic graphs and groups ⋮ Complexity of rainbow vertex connectivity problems for restricted graph classes

Cites Work

• A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
• Geodetic blocks of diameter three
• An extremal problem in geodetic graphs
• Interval-regular graphs of diameter two
• Geodetic graphs of diameter two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bigeodetic graphs