Abstract
In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity; and there are many other examples. Besides reviewing the path convexities in the literature, we propose a general path convexity framework, of which most existing path convexities can be viewed as particular cases. Some benefits of the proposed framework are the systematization of the algorithmic study of related problems and the possibility of defining new convexities not yet investigated.
Similar content being viewed by others
References
Araujo RT, Sampaio RM, Szwarcfiter JL (2013) The convexity of induced paths of order three. Discrete Math 44:109–114
Arnborg S, Lagergren J, Seese D (1991) Easy problems for tree-decomposable graphs. J Algorithms 12(2):308–340
Atici M (2002) Computational complexity of geodetic set. Int J Comput Math 79:587–591
Bodlaender HL (1998) A partial k-arboretum of graphs with bounded treewidth. Theor Comput Sci 209(1–2):1–45
Borie RB, Parker RG, Tovey CA (1992) Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7:555–581
Brandstädt A, Le VB, Spinrad JP (1999) Graph classes: a survey, vol 3. SIAM, Philadelphia
Bueno LR, Penso LD, Protti F, Ramos VR, Rautenbach D, Souza US (2018) On the hardness of finding the geodetic number of a subcubic graph. Inf Process Lett 135:22–27
Cáceres J, Oellermann OR, Puertas ML (2012) Minimal trees and monophonic convexity. Discussiones Mathematicae Graph Theory 32(4):685–704
Cappelle MR, Coelho EMM, Coelho H, Silva BR, Protti F, Souza US (2019) P3-hull number of graphs with diameter two. In: Latin and American algorithms, graphs and optimization symposium. LAGOS 2019. Electronic notes in theoretical computer science, vol 346, pp 309–320
Centeno CC, Dourado MC, Szwarcfiter JL (2009) On the convexity of paths of length two in undirected graphs. Electron Notes Discrete Math 32:11–18
Centeno CC, Dantas S, Dourado MC, Rautenbach D, Szwarcfiter JL (2010) Convex partitions of graphs induced by paths of order three. Discrete Math 12(5):175–184
Centeno CC, Dourado MC, Penso LD, Rautenbach D, Szwarcfiter JL (2011) Irreversible interval of graphs. Theor Comput Sci 412:3693–3700
Changat M, Mathew J (1999) On triangle path convexity in graphs. Discrete Math 206:91–95
Changat M, Mathew J (2004) Induced path transit function, monotone and Peano axioms. Discrete Math 286(3):185–194
Changat M, Klavzar S, Mulder HM (2001) The all-paths transit function of a graph. Czechoslovak Math J 51(2):439–448
Changat M, Mulder HM, Sierksma G (2005) Convexities related to path properties on graphs. Discrete Math 290(2–3):117–131
Changat M, Narasimha-Shenoi PG, Mathews J (2009) Triangle path transit functions, betweenness and pseudo-modular graphs. Discrete Math 309(6):1575–1583
Changat M, Narasimha-Shenoi PG, Pelayo I (2010) The longest path transit function of a graph and betweenness. Utilitas Math 82:111–127
Chartrand G, Garry L, Zhang P (2003) The detour number of a graph. Utilitas Math 64:97–113
Chartrand G, Escuadro H, Zhang P (2005) Detour distance in graphs. J Combin Math Combin Comput 52:75–94
Chepoi V (1997) Peakless functions on graphs. Discrete Appl Math 73(2):175–189
Courcelle B (1997) The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of graph grammars and computing by graph transformations, vol 1, pp 313–400
Courcelle B (1990) The monadic second-order logic of graphs I. Recognizable sets of finite graphs. Inf Comput 25(1):12–75
Courcelle B (1992) The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. Informatique Théorique et Applications 26:257–286
Courcelle B, Engelfriet J (2011) Graph structure and monadic second-order logic. Cambridge University Press, Cambridge
Courcelle B, Mosbah M (1993) Monadic second-order evaluations on tree-decomposable graphs. Theor Comput Sci 109(1):49–82
Courcelle B, Makowsky JA, Rotics U (2000) Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput Syst 33(2):125–150
Diestel R (2005) Graph theory, 3rd edn. Springer, Berlin
Dourado MC, Sampaio RM (2016) Complexity aspects of the triangle path convexity. Discrete Appl Math 206:39–47
Dourado MC, Gimbel JG, Kratochvil J, Protti F, Szwarcfiter JL (2009) On the computation of the hull number of a graph. Discrete Math 309:5668–5674
Dourado MC, Protti F, Szwarcfiter JL (2010) Complexity results related to monophonic convexity. Discrete Math 158:1268–1274
Dourado MC, Rautenbach D, dos Santos VF, Schäfer PM, Szwarcfiter JL, Toman A (2012) An upper bound on the \(P_3\)-Radon number. Discrete Math 312(16):2433–2437
Dragan FF, Nicolai F, Brandstädt A (1999) Convexity and HHD-free graphs. SIAM J Discrete Math 12:119–135
Duarte MA, Penso LD, Rautenbach D, Souza US (2017) Complexity properties of complementary prisms. J Combin Optim 33:365–372
Duchet P (1988) Convex sets in graphs, II. Minimal path convexity. J Combin Theory Ser B 44:307–316
Farber M, Jamison RE (1986) Convexity in graphs and hypergraphs. SIAM J Algebr Discrete Methods 7(3):433–444
Farber M, Jamison RE (1987) On local convexity in graphs. Discrete Math 66:231–247
Gimbel JG (2003) Some remarks on the convexity number of a graph. Graphs Combin 19:357–361
Gutin G, Yeo A (2009) On the number of connected convex subgraphs of a connected acyclic digraph. Discrete Appl Math 157(7):1660–1662
Haas R, Hoffmann M (2006) Chordless path through three vertices. Theor Comput Sci 351:360–371
Harary F (1984) Convexity in graphs: achievement and avoidance games. Ann Discrete Math 20:323
Harary F, Nieminen J (1981) Convexity in graphs. J Differ Geom 16:185–190
Harary F, Loukakis E, Tsouros C (1993) The geodetic number of a graph. Math Comput Model 17(11):89–95
Hliněnỳ P, Oum S, Seese D, Gottlob G (2008) Width parameters beyond tree-width and their applications. Comput J 51(3):326–362
Kanté MM, Nourine L (2013) Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. Theory and practice of computer science. Lect Notes Comput Sci 7741:268–279
Lima CVGC, Protti F, Rautenbach D, Souza US, Szwarcfiter JL (2018) And/or-convexity: a graph convexity based on processes and deadlock models. Ann Oper Res 264:267–286
Nebeský L (1994) A characterization of the interval function of a connected graph. Czechoslov Math J 44(1):173–178
Nielsen MH, Oellermann OR (2011) Steiner trees and convex geometries. SIAM J Discrete Math 23(2):680–693
Parker DB, Westhoff RF, Wolf MJ (2006) Two-path convexity in clone-free regular multipartite tournaments. Australas J Combin 36:177–196
Parvathy KS (1995) Studies on convex structures with emphasis on convexity in graphs. Ph.D. Thesis, Cochin University, Kochi
Pelayo IM (2013) Geodesic convexity in graphs. Springer, New York
Penso LD, Protti F, Rautenbach D, Souza US (2015) Complexity analysis of P3-convexity problems on bounded-degree and planar graphs. Theor Comput Sci 607:83–95
Peterin I (2012) The pre-hull number and lexicographic product. Discrete Appl Math 312:2153–2157
Sampathkumar E (1984) Convex sets in a graph. Indian J Pure Appl Math 15(10):1065–1071
Thompson JVC, Nogueira LT, Protti F, Bravo RSF, Dourado MC, Souza US (2019) A general framework for path convexities. Algorithmic aspects in information and management. AAIM 2019. Lect Notes Comput Sci 11640:272–283
Thorup M (1998) All structured programs have small tree width and good register allocation. Inf Comput 142(2):159–181
van de Vel MLJ (1993) Theory of convex structures. Elsevier, North Holland
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is partially supported by Rio de Janeiro Research Support Foundation (FAPERJ) Grant Number E-26/203.272/2017, and by National Council for Scientific and Technological Development (CNPq-Brazil) Grant Number 303726/2017-2. A preliminary version of this paper appeared in AAIM 2019 (Thompson et al. 2019).
Rights and permissions
About this article
Cite this article
Thompson, J.V.C., Nogueira, L.T., Protti, F. et al. A general framework for path convexities. J Comb Optim 43, 994–1009 (2022). https://doi.org/10.1007/s10878-020-00618-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00618-9