Strongly geodetic graphs
From MaRDI portal
Publication:5550403
DOI10.1016/S0021-9800(68)80052-3zbMATH Open0165.26602MaRDI QIDQ5550403FDOQ5550403
Authors: J. Bosák, Anton Kotzig, Štefan Znám 
Publication date: 1968
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Cited In (24)
- Title not available (Why is that?)
- The maximum girth and minimum circumference of graphs with prescribed radius and diameter
- Title not available (Why is that?)
- Extraconnectivity of graphs with large girth
- Title not available (Why is that?)
- Title not available (Why is that?)
- Moore bound for mixed networks
- Title not available (Why is that?)
- On the extraconnectivity of graphs
- Graphs with large total geodetic number
- Geodesic geometry on graphs
- The impact of emigration on Slovak mathematics: the case of the Bratislava graph theory seminar
- Title not available (Why is that?)
- Irreducible nonmetrizable path systems in graphs
- On the k-index of graphs
- Title not available (Why is that?)
- Strong edge geodetic problem in networks
- Title not available (Why is that?)
- On the impossibility of certain Moore graphs
- Title not available (Why is that?)
- One method for proving the impossibility of certain Moore graphs
- Extraconnectivity of \(s\)-geodetic digraphs and graphs
- On existence and regularity of graphs with certain properties
- Extraconnectivity of graphs with large minimum degree and girth
This page was built for publication: Strongly geodetic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5550403)
