{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:15:51Z","timestamp":1740104151847,"version":"3.37.3"},"reference-count":16,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:00:00Z","timestamp":1543881600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2019,8]]},"abstract":"Abstract<\/jats:title>A graph is called \u2010connected if is \u2010edge\u2010connected and is \u2010edge\u2010connected for every vertex . The study of \u2010connected graphs is motivated by a theorem of Thomassen [J. Combin. Theory Ser. A 110 (2015), pp. 67\u201378] (that was a conjecture of Frank [SIAM J. Discrete Math. 5 (1992), no. 1, pp. 25\u201353]), which states that a graph has a \u2010vertex\u2010connected orientation if and only if it is (2,2)\u2010connected. In this paper, we provide a construction of the family of \u2010connected graphs for even, which generalizes the construction given by Jord\u00e1n [J. Graph Theory 52 (2006), pp. 217\u2013229] for (2,2)\u2010connected graphs. We also solve the corresponding connectivity augmentation problem: given a graph and an integer , what is the minimum number of edges to be added to make \u2010connected. Both these results are based on a new splitting\u2010off theorem for \u2010connected graphs.<\/jats:p>","DOI":"10.1002\/jgt.22433","type":"journal-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T09:56:42Z","timestamp":1543917402000},"page":"305-325","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On \u2010connected graphs"],"prefix":"10.1002","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6789-3777","authenticated-orcid":false,"given":"Olivier","family":"Durand de Gevigney","sequence":"first","affiliation":[{"name":"Routific Vancouver, British Columbia Canada"}]},{"given":"Zolt\u00e1n","family":"Szigeti","sequence":"additional","affiliation":[{"name":"Univ. Grenoble Alpes Grenoble INP, CNRS, G-SCOP Grenoble France"}]}],"member":"311","published-online":{"date-parts":[[2018,12,4]]},"reference":[{"key":"e_1_2_6_1_2_1","doi-asserted-by":"crossref","unstructured":"D. W. Barnette and B. Gr\u00fcnbaum On Steinitz\u2019s theorem concerning convex 3\u2010polytopes and some properties of planar graphs The many facets of graph theory Lecture Notes in Mathematics G. Chartrand S. F. Kapoor (Eds.) Springer 1969 pp. 27\u201340.","DOI":"10.1007\/BFb0060102"},{"key":"e_1_2_6_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20158"},{"key":"e_1_2_6_1_4_1","unstructured":"O.Durand de Gevigney On Frankas conjecture onk\u2010connected orientations. J. Combin. Theory Ser. B (submitted) 2012 ArXiv:1212.4086.."},{"key":"e_1_2_6_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0205044"},{"key":"e_1_2_6_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405003"},{"key":"e_1_2_6_1_7_1","first-page":"111","article-title":"Connectivity and network flows","author":"Frank A.","year":"1995","journal-title":"Handb. Combin."},{"key":"e_1_2_6_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.01.004"},{"key":"e_1_2_6_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20157"},{"key":"e_1_2_6_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1979"},{"volume-title":"Combinatorial problems and exercises","year":"1979","author":"Lov\u00e1sz L.","key":"e_1_2_6_1_11_1"},{"key":"e_1_2_6_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70504-1"},{"key":"e_1_2_6_1_13_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1960-049-6"},{"key":"e_1_2_6_1_14_1","doi-asserted-by":"publisher","DOI":"10.2307\/2303897"},{"key":"e_1_2_6_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2014.07.004"},{"key":"e_1_2_6_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(61)50045-5"},{"key":"e_1_2_6_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(87)90038-9"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22433","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22433","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/jgt.22433","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.22433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T23:50:51Z","timestamp":1694303451000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1002\/jgt.22433"],"URL":"https:\/\/doi.org\/10.1002\/jgt.22433","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"type":"print","value":"0364-9024"},{"type":"electronic","value":"1097-0118"}],"subject":[],"published":{"date-parts":[[2018,12,4]]},"assertion":[{"value":"2018-01-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-11-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}