{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:02Z","timestamp":1780783142972,"version":"3.54.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_6","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:43Z","timestamp":1780780483000},"page":"73-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Rank and\u00a0the\u00a0General Position Number in\u00a0Cycle Convexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7074-2753","authenticated-orcid":false,"given":"J\u00falio","family":"Ar\u00e1ujo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel N.","family":"Ar\u00e1ujo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro P.","family":"Medeiros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4500-5078","authenticated-orcid":false,"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4661-2822","authenticated-orcid":false,"given":"Caroline","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Anand, B.S., Anil, A., Changat, M., Dourado, M.C., Ramla, S.S.: Computing the hull number in $$\\Delta $$-convexity. Theor. Comput. Sci. 844, 217\u2013226 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.08.024. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397520304849","DOI":"10.1016\/j.tcs.2020.08.024"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Anand, B.S., Anil, A., Changat, M., Nair, R.S., Narasimha-Shenoi, P.G.: Helly number, radon number and rank in $$\\Delta $$-convexity on graphs. In: Gaur, D., Mathew, R. (eds.) Algorithms and Discrete Applied Mathematics, pp. 292\u2013306. Springer Nature Switzerland, Cham (2025)","DOI":"10.1007\/978-3-031-83438-7_25"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106420","volume":"183","author":"J Araujo","year":"2024","unstructured":"Araujo, J., Campos, V., Gir\u00e3o, D., Nogueira, J., Salgueiro, A., Silva, A.: On the hull number on cycle convexity of graphs. Inf. Process. Lett. 183, 106420 (2024)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"6_CR4","first-page":"1","volume":"20","author":"J Araujo","year":"2018","unstructured":"Araujo, J., Ducoffe, G., Nisse, N., Suchan, K.: On interval number in cycle convexity. Discrete Math. Theor. Comput. Sci. 20(1), 1\u201328 (2018)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"6_CR5","unstructured":"Ar\u00e1ujo, J., Ar\u00e1ujo, S.N., Medeiros, P.P., Nisse, N., Silva, C.: On the rank and the general position number in cycle convexity. Technical report, Inria & Universit\u00e9 Cote d\u2019Azur, CNRS, I3S, Sophia Antipolis, France (2025). https:\/\/inria.hal.science\/hal-05378038"},{"key":"6_CR6","volume":"487","author":"J Araujo","year":"2025","unstructured":"Araujo, J., Dourado, M.C., Protti, F., Sampaio, R.: The iteration time and the general position number in graph convexities. Appl. Math. Comput. 487, 129084 (2025)","journal-title":"Appl. Math. Comput."},{"key":"6_CR7","unstructured":"Ara\u00fajo, J., Campos, V., Gir\u00e3o, D., Nogueira, J., Salgueiro, A., Silva, A.: Cycle convexity and the tunnel number of links (2020). https:\/\/arxiv.org\/abs\/2012.05656"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Ara\u00fajo, J., Dourado, M.C., Protti, F., Sampaio, R.M.: Introduction to Graph Convexity - An Algorithmic Approach. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-84128-6"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.dam.2017.11.007","volume":"237","author":"R Ara\u00fajo","year":"2018","unstructured":"Ara\u00fajo, R., Sampaio, R., dos Santos, V., Szwarcfiter, J.: The convexity of induced paths of order three and applications: complexity aspects. Discrete Appl. Math. 237, 33\u201342 (2018)","journal-title":"Discrete Appl. Math."},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-60618-1_63","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L Babel","year":"1995","unstructured":"Babel, L., Olariu, S.: On the isomorphism of graphs with few P4s. In: Nagl, M. (ed.) Graph-Theoretic Concepts in Computer Science, pp. 24\u201336. Springer, Heidelberg (1995)"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(97)90120-7","volume":"84","author":"L Babel","year":"1998","unstructured":"Babel, L., Olariu, S.: On the structure of graphs with few P4s. Discret. Appl. Math. 84(1), 1\u201313 (1998)","journal-title":"Discret. Appl. Math."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Bryant, V., Webster, R.: Convexity spaces. I. the basic properties. J. Math. Anal. Appl. 37(1), 206\u2013213 (1972)","DOI":"10.1016\/0022-247X(72)90268-5"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.endm.2009.02.003","volume":"32","author":"CC Centeno","year":"2009","unstructured":"Centeno, C.C., Dourado, M.C., Szwarcfiter, J.L.: On the convexity of paths of length two in undirected graphs. Electron. Notes Discrete Mathe. 32, 11\u201318 (2009)","journal-title":"Electron. Notes Discrete Mathe."},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"DG Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D Corneil","year":"1981","unstructured":"Corneil, D., Lerchs, H., Burlingham, L.: Complement reducible graphs. Discret. Appl. Math. 3(3), 163\u2013174 (1981)","journal-title":"Discret. Appl. Math."},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Courcelle, B., Mosbah, M.: Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109(1), 49\u201382 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90064-Z. https:\/\/www.sciencedirect.com\/science\/article\/pii\/030439759390064Z","DOI":"10.1016\/0304-3975(93)90064-Z"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Duchet, P.: Convex sets in graphs, II. Minimal path convexity. J. Comb. Theory Ser. B 44(3), 307\u2013316 (1988)","DOI":"10.1016\/0095-8956(88)90039-1"},{"key":"6_CR18","unstructured":"Dudeney, H.: Amusements in Mathematics, vol.\u00a0473. Courier Corporation (1958)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF02945032","volume":"2","author":"P Erd\u0151s","year":"1972","unstructured":"Erd\u0151s, P.: Some remarks on simple tournaments. Algebra Universalis 2, 238\u2013245 (1972)","journal-title":"Algebra Universalis"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0095-8956(86)90028-6","volume":"41","author":"P Erd\u00f6s","year":"1986","unstructured":"Erd\u00f6s, P., Saks, M., S\u00f3s, V.T.: Maximum induced trees in graphs. J. Comb. Theory Ser. B 41(1), 61\u201379 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jcta.1997.2829","volume":"81","author":"A Flammenkamp","year":"1998","unstructured":"Flammenkamp, A.: Progress in the no-three-in-line problem, II. J. Comb. Theory Ser. A 81(1), 108\u2013113 (1998)","journal-title":"J. Comb. Theory Ser. A"},{"key":"6_CR22","unstructured":"Frank, A.: Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the Fifth British Combinatorial Conference (1975)"},{"issue":"2","key":"6_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.4310\/jdg\/1214436096","volume":"16","author":"F Harary","year":"1981","unstructured":"Harary, F., Nieminen, J.: Convexity in graphs. J. Differ. Geom. 16(2), 185\u2013190 (1981)","journal-title":"J. Differ. Geom."},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","volume":"61","author":"B Jamison","year":"1995","unstructured":"Jamison, B., Olariu, S.: Linear time optimization algorithms for P4-sparse graphs. Discret. Appl. Math. 61(2), 155\u2013175 (1995)","journal-title":"Discret. Appl. Math."},{"key":"6_CR25","unstructured":"Jamison, R.: A perspective on abstract convexity: classifying alignments by varieties, convexity and related combinational geometry. In: Proceedings University of Oklahoma Conference Marcel Dekker, Inc., New York (1982)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Jamison, R.: Partition numbers for trees and ordered sets. Pac. J. Math. 96 (1981)","DOI":"10.2140\/pjm.1981.96.115"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Kant\u00e9, M., Sampaio, R., dos Santos, V., Szwarcfiter, J.: On the geodetic rank of a graph. J. Comb. 8, 323\u2013340 (2017)","DOI":"10.4310\/JOC.2017.v8.n2.a5"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Proceedings of a Symposium on the Complexity of Computer Computations, vol.\u00a040, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"6_CR29","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/S00453-011-9554-X","volume":"64","author":"M Lampis","year":"2012","unstructured":"Lampis, M.: Algorithmic meta-theorems for restrictions of treewidth. Algorithmica 64(1), 19\u201337 (2012). https:\/\/doi.org\/10.1007\/S00453-011-9554-X","journal-title":"Algorithmica"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Manuel, P., Klavzar, S.: A general position problem in graph theory. Bull. Aust. Math. Soc. 98(2), 177\u2013187 (2018)","DOI":"10.1017\/S0004972718000473"},{"issue":"4","key":"6_CR31","first-page":"339","volume":"163","author":"P Manuel","year":"2018","unstructured":"Manuel, P., Klav\u017ear, S.: The graph theory general position problem on some interconnection networks. Fund. Inform. 163(4), 339\u2013350 (2018)","journal-title":"Fund. Inform."},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Pelayo, I.: Geodesic Convexity in Graphs. Springer (2013)","DOI":"10.1007\/978-1-4614-8699-2"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Ramos, I., dos Santos, V., Szwarcfiter, J.: Complexity aspects of the computation of the rank of a graph. Discrete Math. Theor. Comput. Sci. 16 (2014)","DOI":"10.46298\/dmtcs.2075"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:47Z","timestamp":1780780487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}