{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:52:41Z","timestamp":1725630761417},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642249822"},{"type":"electronic","value":"9783642249839"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24983-9_2","type":"book-chapter","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T05:07:20Z","timestamp":1320642440000},"page":"12-18","source":"Crossref","is-referenced-by-count":0,"title":["Regular Graphs with Maximum Forest Number"],"prefix":"10.1007","author":[{"given":"Avapa","family":"Chantasartrassmee","sequence":"first","affiliation":[]},{"given":"Narong","family":"Punnim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","first-page":"285","volume":"25","author":"S. Bau","year":"2002","unstructured":"Bau, S., Beineke, L.W.: The decycling number of graphs. Austral. J. Combinatorics\u00a025, 285\u2013298 (2002)","journal-title":"Austral. J. Combinatorics"},{"key":"2_CR2","first-page":"65","volume":"81","author":"A. Chantasartrassmee","year":"2006","unstructured":"Chantasartrassmee, A., Punnim, N.: Constrained switchings in cubic graphs. Ars Combinatoria\u00a081, 65\u201379 (2006)","journal-title":"Ars Combinatoria"},{"unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 4th edn. Chapman & Hall\/CRC, A CRC Press Company (2005)","key":"2_CR3"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"S. Hakimi","year":"1962","unstructured":"Hakimi, S.: On the realizability of a set of integers as the degree of the vertices of a graph. SIAM J. Appl. Math.\u00a010, 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs (Czech). Casopis Pest. Mat.\u00a080, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"key":"2_CR6","first-page":"147","volume":"32","author":"N. Punnim","year":"2005","unstructured":"Punnim, N.: Decycling regular graphs. Austral. J. Combinatorics\u00a032, 147\u2013162 (2005)","journal-title":"Austral. J. Combinatorics"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-30540-8_16","volume-title":"Combinatorial Geometry and Graph Theory","author":"N. Punnim","year":"2005","unstructured":"Punnim, N.: The decycling number of cubic graphs. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol.\u00a03330, pp. 141\u2013145. Springer, Heidelberg (2005)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-70666-3_16","volume-title":"Discrete Geometry, Combinatorics and Graph Theory","author":"N. Punnim","year":"2007","unstructured":"Punnim, N.: The decycling number of cubic planar graphs. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol.\u00a04381, pp. 149\u2013161. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Taylor, R.: Constrained switchings in graphs. In: Combinatorial Mathematics. VIII (Geelong, 1980). Lecture Notes in Math., vol.\u00a0884, pp. 314\u2013336 (1981)","key":"2_CR9","DOI":"10.1007\/BFb0091828"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1137\/0603011","volume":"3","author":"R. Taylor","year":"1982","unstructured":"Taylor, R.: Switchings constrained to 2-connectivity in simple graphs. Siam J. Alg. Disc. Math.\u00a03(1), 114\u2013121 (1982)","journal-title":"Siam J. Alg. Disc. Math."}],"container-title":["Lecture Notes in Computer Science","Computational Geometry, Graphs and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24983-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T01:07:39Z","timestamp":1639530459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24983-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642249822","9783642249839"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24983-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}