A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs

DOI10.1016/0095-8956(84)90034-0zbMath0527.05043OpenAlexW2090619033MaRDI QIDQ595678

Ján Plesník

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90034-0

zbMATH Keywords

geodetic blocksgeodetic graphsunique shortest path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (9)

Drawing Shortest Paths in Geodetic Graphs ⋮ Bigeodetic graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Steiner intervals, geodesic intervals, and betweenness ⋮ Drawing Shortest Paths in Geodetic Graphs ⋮ Geodetic graphs of diameter two and some related structures

Cites Work

• An extremal problem in geodetic graphs
• Some general constructions of geodetic blocks
• A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
• Geodetic orientations of complete \(k\)-partite graphs
• A class of geodetic blocks
• On planar geodetic graphs
• Geodetic graphs of diameter two
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs