{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:04:17Z","timestamp":1770753857581,"version":"3.50.0"},"reference-count":18,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T00:00:00Z","timestamp":1697500800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let  be a positive integer. A graph is said to be uniformly \u2010connected if between any pair of vertices the maximum number of independent paths is exactly . Dawes showed that all minimally 3\u2010connected graphs can be constructed from  such that every graph in each intermediate step is also minimally 3\u2010connected. In this paper, we generalize Dawes' result to uniformly 3\u2010connected graphs. We give a constructive characterization of the class of uniformly 3\u2010connected graphs which differs from the characterization provided by G\u00f6ring et al., where their characterization requires the set of all 3\u2010connected and 3\u2010regular graphs as a starting set, the new characterization requires only the graph . Eventually, we obtain a tight bound on the number of edges in uniformly 3\u2010connected graphs.<\/jats:p>","DOI":"10.1002\/jgt.23049","type":"journal-article","created":{"date-parts":[[2023,10,17]],"date-time":"2023-10-17T11:57:46Z","timestamp":1697543866000},"page":"403-412","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Uniformly 3\u2010connected graphs"],"prefix":"10.1002","volume":"105","author":[{"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[{"name":"School of Science Jimei University Xiamen Fujian China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute Jimei University Xiamen Fujian China"}]}],"member":"311","published-online":{"date-parts":[[2023,10,17]]},"reference":[{"key":"e_1_2_6_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060102"},{"key":"e_1_2_6_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(01)00180-7"},{"key":"e_1_2_6_4_1","doi-asserted-by":"crossref","unstructured":"J. A.BondyandU. S. R.Murty Graph theory Springer New York 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"e_1_2_6_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(82)90018-8"},{"key":"e_1_2_6_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(86)90074-2"},{"key":"e_1_2_6_7_1","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1967.228.204"},{"key":"e_1_2_6_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0109047"},{"key":"e_1_2_6_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22820"},{"key":"e_1_2_6_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2022.01.012"},{"key":"e_1_2_6_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1979"},{"key":"e_1_2_6_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.06.002"},{"key":"e_1_2_6_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01304933"},{"key":"e_1_2_6_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01304873"},{"key":"e_1_2_6_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1968-0228369-8"},{"key":"e_1_2_6_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90034-3"},{"key":"e_1_2_6_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.09.005"},{"key":"e_1_2_6_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1385-7258(61)50045-5"},{"key":"e_1_2_6_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.09.047"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.23049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T07:23:13Z","timestamp":1705908193000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.23049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,17]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1002\/jgt.23049"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1002\/jgt.23049","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,17]]},"assertion":[{"value":"2023-01-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-05","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}