Partitioning a graph into convex sets, Discrete Math, vol.311, pp.1968-1977, 2011. ,
Geodetic graphs of diameter two, Geom. Dedicata, vol.25, pp.527-533, 1988. ,
Minimum k-path vertex cover, Discrete Appl. Math, vol.159, pp.1189-1195, 2011. ,
On the geodetic number and related metric sets in Cartesian product graphs, Discrete Math, vol.308, pp.5555-5561, 2008. ,
Geodetic sets in graphs, Structural Analysis of Complex Networks, pp.197-218, 2011. ,
On the hardness of finding the geodetic number of a subcubic graph, Inform. Process. Lett, vol.135, pp.22-27, 2018. ,
Geodetic sets in graphs, Discuss. Math. Graph Theory, vol.20, pp.129-138, 2000. ,
The ultimate isometric path number of a graph, Util. Math, vol.76, pp.129-144, 2008. ,
Some remarks on the geodetic number of a graph, Discrete Math, vol.310, pp.832-837, 2010. ,
The isometric path number of a graph, J. Combin. Math. Combin. Comput, vol.38, pp.97-110, 2001. ,
The isometric path number of the Cartesian product of paths, Congr. Numer, vol.137, pp.109-119, 1999. ,
, Strong geodetic cores and Cartesian product graphs, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01756450
Convex p-partitions of bipartite graphs, Theoret. Comput. Sci, vol.609, pp.511-514, 2016. ,
DOI : 10.1016/j.tcs.2015.11.014
URL : http://arxiv.org/pdf/1501.01707
On pitfalls in computing the geodetic number of a graph, Optimization Letters, vol.1, pp.299-307, 2007. ,
The geodetic number of a graph, Math. Comput. Modelling, vol.17, pp.89-95, 1993. ,
Topics in Graph Theory. Graphs and their Cartesian Product, A K Peters, 2008. ,
Strong geodetic number of complete bipartite graphs and of graphs with specified diameter, Graphs Combin, vol.34, pp.443-456, 2018. ,
Strong geodetic problem on Cartesian products of graphs, RAIRO Oper. Res, vol.52, pp.205-216, 2018. ,
, Strong geodetic problem on complete multipartite graphs, 2018.
On the k-path vertex cover of some graph products, Discrete Math, vol.313, pp.94-100, 2013. ,
Geodesic convexity and Cartesian products in graphs, 2004. ,
Strong geodetic problem in grid like architectures, Bull. Malays. Math. Sci. Soc, vol.41, pp.1671-1680, 2018. ,
The k-path vertex cover in Cartesian product graphs and complete bipartite graphs, Appl. Math. Comput, vol.331, pp.69-79, 2018. ,
DOI : 10.1016/j.amc.2018.03.008
Strong geodetic problem in networks, Discuss. Math. Graph. Theory ,
Strong edge geodetic problem in networks, Open Math, vol.15, pp.1225-1235, 2017. ,
DOI : 10.1515/math-2017-0101
URL : http://www.degruyter.com/downloadpdf/j/math.2017.15.issue-1/math-2017-0101/math-2017-0101.xml
Theory of Graphs, Amer. Math. Soc, 1962. ,
Isometric path numbers of graphs, Discrete Math, vol.306, pp.2091-2096, 2006. ,
DOI : 10.1016/j.disc.2006.04.003
URL : https://doi.org/10.1016/j.disc.2006.04.003
Geodesic Convexity in Graphs, Springer Briefs in Mathematics, 2013. ,
DOI : 10.1007/978-1-4614-8699-2
Products of geodesic graphs and the geodetic number of products, Discuss. Math. Graph Theory, vol.35, pp.35-42, 2015. ,
Geodetic sets and Steiner sets in graphs, Discrete Math, vol.309, pp.4205-4207, 2009. ,
DOI : 10.1016/j.disc.2008.10.010
URL : https://doi.org/10.1016/j.disc.2008.10.010
Enumeration of labeled geodetic graphs with a small cyclomatic number, Mat. Zametki, vol.101, pp.684-689, 2017. ,