{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:43:39Z","timestamp":1725637419555},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642258695"},{"type":"electronic","value":"9783642258701"}],"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-25870-1_22","type":"book-chapter","created":{"date-parts":[[2011,11,30]],"date-time":"2011-11-30T13:32:45Z","timestamp":1322659965000},"page":"238-249","source":"Crossref","is-referenced-by-count":2,"title":["On the Independence Number of Graphs with Maximum Degree 3"],"prefix":"10.1007","author":[{"given":"Iyad A.","family":"Kanj","sequence":"first","affiliation":[]},{"given":"Fenghui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002240000113","volume":"32","author":"P. Berman","year":"1999","unstructured":"Berman, P., Fujito, T.: On approximation properties of the independent set problem for low degree graphs. Theory Comput. Syst.\u00a032(2), 115\u2013132 (1999)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"22_CR2","first-page":"194","volume":"37","author":"R. Brooks","year":"1941","unstructured":"Brooks, R.: On colouring the nodes of a network. Math. Phys. Sci.\u00a037(4), 194\u2013197 (1941)","journal-title":"Math. Phys. Sci."},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1137\/050646354","volume":"37","author":"J. Chen","year":"2007","unstructured":"Chen, J., Fernau, H., Kanj, I., Xia, G.: Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. SIAM Journal on Computing\u00a037(4), 1077\u20131106 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)"},{"key":"22_CR5","first-page":"269","volume":"21","author":"S. Fajtlowicz","year":"1978","unstructured":"Fajtlowicz, S.: On the size of independent sets in graphs. Congr. Numer.\u00a021, 269\u2013274 (1978)","journal-title":"Congr. Numer."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jctb.1995.1043","volume":"65","author":"K. Fraughnaugh","year":"1995","unstructured":"Fraughnaugh, K., Locke, S.: Finding large independent sets in connected triangle-free 3-regular graphs. Journal of Combinatorial Theory B\u00a065, 51\u201372 (1995)","journal-title":"Journal of Combinatorial Theory B"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete problems. In: STOC, pp. 47\u201363. ACM (1974)","DOI":"10.1145\/800119.803884"},{"issue":"23","key":"22_CR8","doi-asserted-by":"publisher","first-page":"5829","DOI":"10.1016\/j.disc.2007.10.029","volume":"308","author":"J. Harant","year":"2008","unstructured":"Harant, J., Henning, M., Rautenbach, D., Schiermeyer, I.: The independence number in graphs of maximum degree three. Discrete Mathematics\u00a0308(23), 5829\u20135833 (2008)","journal-title":"Discrete Mathematics"},{"issue":"1-3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0012-365X(00)00242-9","volume":"233","author":"C. Heckman","year":"2001","unstructured":"Heckman, C., Thomas, R.: A new proof of the independence ratio of triangle-free cubic graphs. Discrete Mathematics\u00a0233(1-3), 233\u2013237 (2001)","journal-title":"Discrete Mathematics"},{"issue":"5","key":"22_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1002\/jgt.3190140503","volume":"14","author":"K. Jones","year":"1990","unstructured":"Jones, K.: Size and independence in triangle-free graphs with maximum degree three. Journal of Graph Theory\u00a014(5), 525\u2013535 (1990)","journal-title":"Journal of Graph Theory"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0002-9947-1979-0546922-6","volume":"256","author":"W. Staton","year":"1979","unstructured":"Staton, W.: Some Ramsey-type numbers and the independence ratio. Transactions of the American Mathematical Society\u00a0256, 353\u2013370 (1979)","journal-title":"Transactions of the American Mathematical Society"},{"key":"22_CR12","volume-title":"Introduction to graph theory","author":"D. West","year":"1996","unstructured":"West, D.: Introduction to graph theory. Prentice-Hall, NJ (1996)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-11440-3_26","volume-title":"WALCOM: Algorithms and Computation","author":"M. Xiao","year":"2010","unstructured":"Xiao, M.: A simple and fast algorithm for maximum independent set in 3-degree graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol.\u00a05942, pp. 281\u2013292. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25870-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T01:07:02Z","timestamp":1555722422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25870-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642258695","9783642258701"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25870-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}