{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:39:11Z","timestamp":1772753951658,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2023,4,23]],"date-time":"2023-04-23T00:00:00Z","timestamp":1682208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,23]],"date-time":"2023-04-23T00:00:00Z","timestamp":1682208000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100015310","name":"Natural Science Foundation of Xinjiang","doi-asserted-by":"publisher","award":["2020D04046"],"award-info":[{"award-number":["2020D04046"]}],"id":[{"id":"10.13039\/501100015310","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861066"],"award-info":[{"award-number":["11861066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s11227-023-05287-z","type":"journal-article","created":{"date-parts":[[2023,4,23]],"date-time":"2023-04-23T16:01:50Z","timestamp":1682265710000},"page":"15980-15996","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences"],"prefix":"10.1007","volume":"79","author":[{"given":"Xuemei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,23]]},"reference":[{"issue":"2","key":"5287_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.20299","volume":"54","author":"D Bauer","year":"2009","unstructured":"Bauer D, Hakimi SL, Kahl N, Schmeichel E (2009) Sufficient degree conditions for $$k$$-edge-connectedness of a graph. Networks 54(2):95\u201398","journal-title":"Networks"},{"key":"5287_CR2","volume-title":"Hypergraphs: Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge C (1989) Hypergraphs: Combinatorics of Finite Sets. North-Holland, Amsterdam"},{"issue":"2","key":"5287_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0095-8956(74)90058-6","volume":"16","author":"FT Boesch","year":"1974","unstructured":"Boesch FT (1974) The strongest monotone degree condition for $$n$$-connectedness of a graph. J Comb Theory Ser B 16(2):162\u2013165","journal-title":"J Comb Theory Ser B"},{"key":"5287_CR4","first-page":"473","volume":"4","author":"JA Bondy","year":"1969","unstructured":"Bondy JA (1969) Properties of graphs with constraints on degrees. Studia Sci Math Hung 4:473\u2013475","journal-title":"Studia Sci Math Hung"},{"issue":"4","key":"5287_CR5","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1137\/0114065","volume":"14","author":"G Chartrand","year":"1966","unstructured":"Chartrand G (1966) A graph-theoretic approach to a communications problem. SIAM J Appl Math 14(4):778\u2013781","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"5287_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0095-8956(72)90020-2","volume":"12","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal V (1972) On Hamilton\u2019s ideals. J Comb Theory Ser B 12(2):163\u2013168","journal-title":"J Comb Theory Ser B"},{"issue":"2","key":"5287_CR7","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.disc.2015.07.008","volume":"339","author":"P Dankelmann","year":"2016","unstructured":"Dankelmann P, Meierling D (2016) Maximally edge-connected hypergraphs. Discrete Math 339(2):33\u201338","journal-title":"Discrete Math"},{"issue":"2","key":"5287_CR8","doi-asserted-by":"publisher","first-page":"252","DOI":"10.4153\/CMB-2018-005-9","volume":"61","author":"M Dewar","year":"2018","unstructured":"Dewar M, Pike D, Proos J (2018) Connectivity in hypergraphs. Canad Math Bull 61(2):252\u2013271","journal-title":"Canad Math Bull"},{"issue":"1","key":"5287_CR9","first-page":"68","volume":"3","author":"GA Dirac","year":"1952","unstructured":"Dirac GA (1952) Some theorems on abstract graphs. Proc Lond Math Soc 3(1):68\u201381","journal-title":"Proc Lond Math Soc"},{"issue":"12","key":"5287_CR10","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1016\/j.disc.2013.03.003","volume":"313","author":"XF Gu","year":"2013","unstructured":"Gu XF, Lai HJ (2013) Realizing degree sequences with $$k$$-edge-connected uniform hypergraphs. Discrete Math 313(12):1394\u20131400","journal-title":"Discrete Math"},{"issue":"2","key":"5287_CR11","first-page":"243","volume":"17","author":"AK Kelman","year":"1972","unstructured":"Kelman AK (1972) Asymptonic formulas for the probability of $$k$$-connectedness of random graphs. Theory Probab Appl 17(2):243\u2013254","journal-title":"Theory Probab Appl"},{"issue":"2","key":"5287_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s12188-016-0171-0","volume":"87","author":"M Kriesell","year":"2017","unstructured":"Kriesell M (2017) Degree sequences and edge connectivity. Abh Math Semin Univ Hambg 87(2):343\u2013355","journal-title":"Abh Math Semin Univ Hambg"},{"key":"5287_CR13","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.dam.2022.06.029","volume":"321","author":"XM Liu","year":"2022","unstructured":"Liu XM, Meng JX, Tian YZ (2022) On forcibly $$k$$-connected and forcibly $$k$$-arc-connected digraphic sequences. Discrete Appl Math 321:10\u201318","journal-title":"Discrete Appl Math"},{"key":"5287_CR14","doi-asserted-by":"crossref","unstructured":"Liu XM, Meng JX, Tian YZ (2022) On forcibly $$k$$-connected uniform hypergraphic sequences. (submitted for publication)","DOI":"10.1007\/s40305-023-00509-w"},{"key":"5287_CR15","doi-asserted-by":"crossref","unstructured":"Nash-Williams CSJA (1971) Hamiltonian arcs and circuits. In: Recent Trends in Graph Theory Lecture Notes in Mathematics. Springer, pp 197\u2013210","DOI":"10.1007\/BFb0059438"},{"key":"5287_CR16","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2018.11.004","volume":"264","author":"EF Shan","year":"2019","unstructured":"Shan EF, Zhao J, Zhao LY (2019) Maximally connected $$p$$-partite uniform hypergraphs. Discrete Appl Math 264:188\u2013195","journal-title":"Discrete Appl Math"},{"issue":"1","key":"5287_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s40305-018-0224-4","volume":"9","author":"LK Tong","year":"2021","unstructured":"Tong LK, Shan EF (2021) Sufficient conditions for maximally edge-connected hypergraphs. J Oper Res Soc China 9(1):119\u2013129","journal-title":"J Oper Res Soc China"},{"issue":"1","key":"5287_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10255-022-1057-9","volume":"38","author":"JH Yin","year":"2022","unstructured":"Yin JH, Guo JY (2022) A new sufficient degree condition for a graphic sequence to be forcibly $$k$$-edge-connected. Acta Math Appl Sinica (Engl Ser) 38(1):223\u2013228","journal-title":"Acta Math Appl Sinica (Engl Ser)"},{"key":"5287_CR19","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/j.amc.2018.03.109","volume":"333","author":"S Zhao","year":"2018","unstructured":"Zhao S, Meng JX (2018) Sufficient conditions for hypergraphs to be maximally edge-connected hypergraphs. Appl Math Comput 333:362\u2013368","journal-title":"Appl Math Comput"},{"issue":"4","key":"5287_CR20","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1007\/s00373-020-02165-w","volume":"36","author":"S Zhao","year":"2020","unstructured":"Zhao S, Tian YZ, Meng JX (2020) Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs. Graphs Combin 36(4):1065\u20131078","journal-title":"Graphs Combin"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05287-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05287-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05287-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T08:15:49Z","timestamp":1702282549000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05287-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,23]]},"references-count":20,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["5287"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05287-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,23]]},"assertion":[{"value":"10 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}