{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:00Z","timestamp":1759638780300,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:00:00Z","timestamp":1628726400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T00:00:00Z","timestamp":1628726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2016-05237"],"award-info":[{"award-number":["RGPIN-2016-05237"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10878-021-00789-z","type":"journal-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T17:02:51Z","timestamp":1628787771000},"page":"543-570","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The maximum average connectivity among all orientations of a graph"],"prefix":"10.1007","volume":"43","author":[{"given":"Roc\u00edo M.","family":"Casablanca","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Dankelmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wayne","family":"Goddard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4295-0632","authenticated-orcid":false,"given":"Lucas","family":"Mol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ortrud","family":"Oellermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,12]]},"reference":[{"key":"789_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(01)00180-7","volume":"252","author":"LW Beineke","year":"2002","unstructured":"Beineke LW, Oellermann OR, Pippert RE (2002) The average connectivity of a graph. Discrete Math 252:31\u201345","journal-title":"Discrete Math"},{"key":"789_CR2","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"2004","unstructured":"Bollob\u00e1s B (2004) Extremal graph theory. Dover Publications, Mineola"},{"key":"789_CR3","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.dam.2020.10.015","volume":"289","author":"RM Casablanca","year":"2021","unstructured":"Casablanca RM, Mol L, Oellermann OR (2021) Average connectivity of minimally $$2$$-connected graphs and average edge-connectivity of minimally $$2$$-edge-connected graphs. Discrete Appl Math 289:233\u2013247","journal-title":"Discrete Appl Math"},{"key":"789_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973) Tough graphs and Hamiltonian circuits. Discrete Math 5:215\u2013228","journal-title":"Discrete Math"},{"key":"789_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/S0166-218X(02)00572-3","volume":"129","author":"P Dankelmann","year":"2003","unstructured":"Dankelmann P, Oellermann OR (2003) On the average connectivity of a graph. Discrete Appl Math 129:305\u2013318","journal-title":"Discrete Appl Math"},{"key":"789_CR6","first-page":"204","volume":"228","author":"GA Dirac","year":"1967","unstructured":"Dirac GA (1967) Minimally $$2$$-connected graphs. J Reine Angew Math 228:204\u2013216","journal-title":"J Reine Angew Math"},{"key":"789_CR7","doi-asserted-by":"crossref","unstructured":"Durand de Gevigney O (2020) On Frank\u2019s conjecture on $$k$$-connected orientations. J Combin Theory Ser B 141:105\u2013114","DOI":"10.1016\/j.jctb.2019.07.001"},{"key":"789_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.dam.2003.04.003","volume":"140","author":"MA Henning","year":"2004","unstructured":"Henning MA, Oellermann OR (2004) The average connectivity of a digraph. Discrete Appl Math 140:143\u2013153","journal-title":"Discrete Appl Math"},{"key":"789_CR9","first-page":"101","volume":"23","author":"MA Henning","year":"2001","unstructured":"Henning MA, Oellermann OR (2001) The average connectivity of regular multipartite tournaments. Australas J Combin 23:101\u2013113","journal-title":"Australas J Combin"},{"key":"789_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01304873","volume":"23","author":"W Mader","year":"1972","unstructured":"Mader W (1972) Ecken vom Grad $$n$$ in minimalen $$n$$-fach zusammenh\u00e4ngenden Graphen. Arch Math 23:219\u2013224","journal-title":"Arch Math"},{"key":"789_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70504-1","volume":"3","author":"W Mader","year":"1978","unstructured":"Mader W (1978) A reduction method for edge-connectivity in graphs. Ann Discrete Math 3:145\u2013164","journal-title":"Ann Discrete Math"},{"key":"789_CR12","doi-asserted-by":"publisher","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","volume":"12","author":"CSJA Nash-Williams","year":"1960","unstructured":"Nash-Williams CSJA (1960) On orientations, connectivity and odd-vertex-pairings in finite graphs. Can J Math 12:555\u2013567","journal-title":"Can J Math"},{"key":"789_CR13","unstructured":"Oellermann OR (2013) Menger\u2019s theorem. In: Beineke LW, Wilson RJ (eds) Topics in structural graph theory. Cambridge University Press, Cambridge"},{"issue":"1","key":"789_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1090\/S0002-9947-1968-0228369-8","volume":"134","author":"MD Plummer","year":"1968","unstructured":"Plummer MD (1968) On minimal blocks. Trans. Am. Math. Soc. 134(1):85\u201394","journal-title":"Trans. Am. Math. Soc."},{"key":"789_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"HE Robbins","year":"1939","unstructured":"Robbins HE (1939) Questions, discussions, and notes: a theorem on graphs, with an application to a problem of traffic control. Am. Math. Mon. 46:281\u2013283","journal-title":"Am. Math. Mon."},{"key":"789_CR16","doi-asserted-by":"crossref","unstructured":"Thomassen C (1989) Configurations in graphs of large minimum degree, connectivity, or chromatic number. In: Proceedings of the third international conference on combinatorial mathematics, New York 1985, Annals of the New York Academy of Sciences, New York, vol 555, pp 402\u2013412","DOI":"10.1111\/j.1749-6632.1989.tb22479.x"},{"key":"789_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jctb.2014.07.004","volume":"110","author":"C Thomassen","year":"2014","unstructured":"Thomassen C (2014) Strongly $$2$$-connected orientations of graphs. J Combin Theory Ser B 110:67\u201378","journal-title":"J Combin Theory Ser B"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00789-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00789-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00789-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:06:10Z","timestamp":1648587970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00789-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["789"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00789-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2021,8,12]]},"assertion":[{"value":"8 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}