{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T04:28:03Z","timestamp":1778732883430,"version":"3.51.4"},"reference-count":11,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":3992,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1995,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In a recent paper, Barnette showed that every 3\u2010connected planar graph has a 2\u2010connected spanning subgraph of maximum degree at most fifteen, he also constructed a planar triangulation that does not have 2\u2010connected spanning subgraphs of maximum degree five. In this paper, we show that every 3\u2010connected graph which is embeddable in the sphere, the projective plane, the torus or the Klein bottle has a 2\u2010connected spanning subgraph of maximum degree at most six. \u00a9 1995 John Wiley &amp; Sons, Inc.<\/jats:p>","DOI":"10.1002\/jgt.3190200309","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T16:21:19Z","timestamp":1181233279000},"page":"327-338","source":"Crossref","is-referenced-by-count":19,"title":["2\u2010connected coverings of bounded degree in 3\u2010connected graphs"],"prefix":"10.1002","volume":"20","author":[{"given":"Zhicheng","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1966-073-4"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1045"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_5_2","article-title":"Spanning planar subgraphs of grpahs in the torus and Klein bottle","author":"Brunet R.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"e_1_2_1_6_2","article-title":"Computing the orientable genus of projective graphs","author":"Fieldler J.","journal-title":"J. Graph Theory"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1068"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02986656"},{"key":"e_1_2_1_9_2","first-page":"135","article-title":"k\u2010walks of graphs","volume":"2","author":"Jackson B.","year":"1990","journal-title":"Australasian J. Combinatorics"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1058"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1956-0081471-8"},{"key":"e_1_2_1_12_2","volume-title":"Graph Theory","author":"Tutte W. T.","year":"1984"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190200309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190200309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T06:59:40Z","timestamp":1698303580000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190200309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["10.1002\/jgt.3190200309"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190200309","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}