Skip to main content Accessibility help


  • PAUL MANUEL (a1) and SANDI KLAVŽAR (a2) (a3) (a4)


The paper introduces a graph theory variation of the general position problem: given a graph $G$ , determine a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is a max-gp-set of $G$ and its size is the gp-number $\text{gp}(G)$ of $G$ . Upper bounds on $\text{gp}(G)$ in terms of different isometric covers are given and used to determine the gp-number of several classes of graphs. Connections between general position sets and packings are investigated and used to give lower bounds on the gp-number. It is also proved that the general position problem is NP-complete.


Corresponding author


Hide All

This work was supported and funded by Kuwait University, Research Project No. QI 02/17.



Hide All
[1] Barnaby, M., Raimondi, F., Chen, T. and Martin, J., ‘The packing chromatic number of the infinite square lattice is between 13 and 15’, Discrete Appl. Math. 225 (2017), 136142.
[2] Beaudou, L., Gravier, S. and Meslem, K., ‘Subdivided graphs as isometric subgraphs of Hamming graphs’, European J. Combin. 30 (2009), 10621070.
[3] Brešar, B., Klavžar, S., Rall, D. F. and Wash, K., ‘Packing chromatic number, (1, 1, 2, 2)-colorings, and characterizing the Petersen graph’, Aequationes Math. 91 (2017), 169184.
[4] Dankelmann, P., ‘Average distance and generalised packing in graphs’, Discrete Math. 310 (2010), 23342344.
[5] Dudeney, H. E., Amusements in Mathematics (Nelson, Edinburgh, 1917).
[6] Fitzpatrick, S. L., ‘The isometric path number of the Cartesian product of paths’, Congr. Numer. 137 (1999), 109119.
[7] Froese, V., Kanj, I., Nichterlein, A. and Niedermeier, R., ‘Finding points in general position’, Internat. J. Comput. Geom. Appl. 27 (2017), 277296.
[8] Garey, M. R. and Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman, New York, 1979).
[9] Goddard, W. and Xu, H., ‘The S-packing chromatic number of a graph’, Discuss. Math. Graph Theory 32 (2012), 795806.
[10] Hartnell, B. and Whitehead, C. A., ‘On k-packings of graphs’, Ars Combin. 47 (1997), 97108.
[11] Meir, A. and Moon, J. W., ‘Relations between packing and covering numbers of a tree’, Pacific J. Math. 61 (1975), 225233.
[12] Misiak, A., Stpień, Z., Szymaszkiewicz, A., Szymaszkiewicz, L. and Zwierzchowski, M., ‘A note on the no-three-in-line problem on a torus’, Discrete Math. 339 (2016), 217221.
[13] Pan, J.-J. and Chang, G. J., ‘Isometric-path numbers of block graphs’, Inform. Process. Lett. 93 (2005), 99102.
[14] Pan, J.-J. and Chang, G. J., ‘Isometric path numbers of graphs’, Discrete Math. 306 (2006), 20912096.
[15] Payne, M. and Wood, D. R., ‘On the general position subset selection problem’, SIAM J. Discrete Math. 27 (2013), 17271733.
[16] Pěgřímek, D. and Gregor, P., ‘Hamiltonian laceability of hypercubes without isometric subgraphs’, Graphs Combin. 32 (2016), 25912624.
[17] Polat, N., ‘On isometric subgraphs of infinite bridged graphs and geodesic convexity’, Discrete Math. 244 (2002), 399416.
[18] Por, A. and Wood, D. R., ‘No-three-in-line-in-3D’, Algorithmica 47 (2007), 481488.
[19] Shpectorov, S. V., ‘Distance-regular isometric subgraphs of the halved cubes’, European J. Combin. 19 (1998), 119136.
MathJax is a JavaScript display engine for mathematics. For more information see


MSC classification


  • PAUL MANUEL (a1) and SANDI KLAVŽAR (a2) (a3) (a4)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed