An extremal problem in geodetic graphs
From MaRDI portal
Publication:792335
DOI10.1016/0012-365X(84)90112-2zbMATH Open0537.05029OpenAlexW1977813728MaRDI QIDQ792335FDOQ792335
Authors: N. E. Zubov 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90112-2
Recommendations
- scientific article; zbMATH DE number 1472187
- scientific article; zbMATH DE number 38308
- Extremal problems for geometric hypergraphs
- Extremal problems for geometric hypergraphs
- scientific article; zbMATH DE number 2170483
- Some results on geodetic number of graphs
- Geodesics in graphs, an extremal set problem, and perfect hash families
- A characterization of geodetic graphs
- scientific article; zbMATH DE number 4025472
- STRONG DOUBLY GEODETIC PROBLEM ON GRAPHS
Cites Work
- Parallel concepts in graph theory
- Title not available (Why is that?)
- Some general constructions of geodetic blocks
- Geodetic graphs of diameter two
- A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares
- Geodetic orientations of complete \(k\)-partite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- A class of geodetic blocks
- A note on 3-Steiner intervals and betweenness
- Title not available (Why is that?)
- Geodetic blocks of diameter three
- A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs
- A new upper bound on the number of edges in a geodetic graph
- Title not available (Why is that?)
- STRONG k-GEODETIC PROBLEM IN GRAPHS: COMPUTATIONAL COMPLEXITY AND SOME RESULTS
- Title not available (Why is that?)
- Graham's problem on shortest networks for points on a circle
- Bigeodetic graphs
- Towards minimumk-geodetically connected graphs
This page was built for publication: An extremal problem in geodetic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792335)
