{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:18:45Z","timestamp":1742973525529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_4","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T13:35:02Z","timestamp":1455888902000},"page":"40-51","source":"Crossref","is-referenced-by-count":1,"title":["Vertex-Coloring with Star-Defects"],"prefix":"10.1007","author":[{"given":"Patrizio","family":"Angelini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Bekos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kaufmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"Roselli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","first-page":"33","volume":"47","author":"J Andrews","year":"1985","unstructured":"Andrews, J., Jacobson, M.S.: On a generalization of chromatic number. Congressus Numerantium 47, 33\u201348 (1985)","journal-title":"Congressus Numerantium"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P., Bekos, M.A., Kaufmann, M., Roselli, V.: Vertex-coloring with star-defects. Arxiv report arxiv.org\/abs\/1512.02505 (2015)","DOI":"10.1007\/978-3-319-30139-6_4"},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1002\/jgt.3190110408","volume":"11","author":"D Archdeacon","year":"1987","unstructured":"Archdeacon, D.: A note on defective coloring of graphs in surfaces. J. Graph Theor. 11(4), 517\u2013519 (1987)","journal-title":"J. Graph Theor."},{"key":"4_CR4","volume-title":"Graphs and Digraphs","author":"G Chartrand","year":"1986","unstructured":"Chartrand, G., Lesniak, L.M.: Graphs and Digraphs. Wadsworth, Monterey (1986)"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theor. 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Theor."},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199703)24:3<205::AID-JGT2>3.0.CO;2-T","volume":"24","author":"LJ Cowen","year":"1997","unstructured":"Cowen, L.J., Goddard, W., Jesurum, C.E.: Defective coloring revisited. J. Graph Theor. 24(3), 205\u2013219 (1997)","journal-title":"J. Graph Theor."},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30(3), 289\u2013293 (1980)","journal-title":"Discrete Math."},{"issue":"13","key":"4_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0012-365X(94)00337-I","volume":"149","author":"G Ding","year":"1996","unstructured":"Ding, G., Oporowski, B.: On tree-partitions of graphs. Discrete Math. 149(13), 45\u201358 (1996)","journal-title":"Discrete Math."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-642-22935-0_45","volume-title":"Approximation, Randomization, and Combinatorial Optimization","author":"A Edelman","year":"2011","unstructured":"Edelman, A., Hassidim, A., Nguyen, H.N., Onak, K.: An efficient partitioning oracle for bounded-treewidth graphs. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds.) RANDOM 2011 and APPROX 2011. LNCS, vol. 6845, pp. 530\u2013541. Springer, Heidelberg (2011)"},{"key":"4_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"issue":"11","key":"4_CR11","first-page":"1382","volume":"55","author":"G Gonthier","year":"2008","unstructured":"Gonthier, G.: Formal proof\u2013the four-color theorem. Not. Am. Math. Soc. 55(11), 1382\u20131393 (2008)","journal-title":"Not. Am. Math. Soc."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. Comput."},{"key":"4_CR13","first-page":"205","volume":"50","author":"F Harary","year":"1985","unstructured":"Harary, F., Jones, K.: Conditional colorability II: bipartite variations. Congressus Numerantium 50, 205\u2013218 (1985)","journal-title":"Congressus Numerantium"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Heidelberg (1972)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1007\/s00453-009-9295-2","volume":"58","author":"L Kowalik","year":"2010","unstructured":"Kowalik, L.: Fast 3-coloring triangle-free planar graphs. Algorithmica 58(3), 770\u2013789 (2010)","journal-title":"Algorithmica"},{"key":"4_CR16","first-page":"237","volume":"1","author":"L Lov\u00e1sz","year":"1966","unstructured":"Lov\u00e1sz, L.: On decomposition of graphs. Studia Scientiarum Mathematicarum Hungarica 1, 237\u2013238 (1966)","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","volume":"19","author":"L Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Three short proofs in graph theory. J. Comb. Theor. Ser. B 19(3), 269\u2013271 (1975)","journal-title":"J. Comb. Theor. Ser. B"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s00283-012-9307-y","volume":"34","author":"P Maritz","year":"2012","unstructured":"Maritz, P., Mouton, S.: Francis guthrie: a colourful life. Math. Intell. 34(3), 67\u201375 (2012)","journal-title":"Math. Intell."},{"key":"4_CR19","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"2007","unstructured":"Papadimitriou, C.H.: Computational Complexity. Academic Internet Publ., London (2007)"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0607016","volume":"7","author":"A Proskurowski","year":"1986","unstructured":"Proskurowski, A., Syso, M.M.: Efficient vertex- and edge-coloring of outerplanar graphs. SIAM J. Algebraic Discrete Methods 7(1), 131\u2013136 (1986)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1016\/j.ejc.2008.11.010","volume":"30","author":"DR Wood","year":"2009","unstructured":"Wood, D.R.: On tree-partition-width. Eur. J. Comb. 30(5), 1245\u20131253 (2009). Part Special Issue on Metric Graph Theory","journal-title":"Eur. J. Comb."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,4]],"date-time":"2022-06-04T16:13:11Z","timestamp":1654359191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}