{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:39:57Z","timestamp":1754109597038},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427070"},{"type":"electronic","value":"9783540454779"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45477-2_14","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:09:01Z","timestamp":1187248141000},"page":"140-153","source":"Crossref","is-referenced-by-count":17,"title":["On Star Coloring of Graphs"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Fertin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"2","author":"N. Alon","year":"1990","unstructured":"N. Alon, C. McDiarmid, and B. Reed. Acyclic colourings of graphs. Random Structures and Algorithms, 2:277\u2013288, 1990.","journal-title":"Random Structures and Algorithms"},{"issue":"1","key":"14_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF02675788","volume":"67","author":"O.V. Borodin","year":"2000","unstructured":"O.V. Borodin, A.V. Kostochka, A. Raspaud, and E. Sopena. Acyclic k-strong coloring of maps on surfaces. Mathematical Notes, 67(1):29\u201335, 2000.","journal-title":"Mathematical Notes"},{"issue":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1112\/S0024610799007942","volume":"60","author":"O.V. Borodin","year":"1999","unstructured":"O.V. Borodin, A.V. Kostochka, and D.R. Woodall. Acyclic colourings of planar graphs with large girth. J. London Math. Soc., 60(2):344\u2013352, 1999.","journal-title":"J. London Math. Soc."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, V.B. Le, and J.P. Spinrad. Graph Classes A survey. SIAM Monographs on D.M. and Applications, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00228-4","volume":"209","author":"H.L. Bodlander","year":"1998","unstructured":"H.L. Bodlander. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1\u201345, 1998.","journal-title":"Theoretical Computer Science"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"O.V. Borodin","year":"1979","unstructured":"O.V. Borodin. On acyclic colorings of planar graphs. Discrete Mathematics, 25:211\u2013236, 1979.","journal-title":"Discrete Mathematics"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"G. Fertin, A. Raspaud, and B. Reed. On star coloring of graphs. Technical report, 2001.","DOI":"10.1007\/3-540-45477-2_14"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"B. Gr\u00fcnbaum. Acyclic colorings of planar graphs. Israel J. Math., 14(3):390\u2013408, 1973.","journal-title":"Israel J. Math."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0166-218X(99)00249-8","volume":"103","author":"D.S. Kim","year":"2000","unstructured":"D.S. Kim, D.-Z. Du, and P.M. Pardalos. A coloring problem on the n-cube. Discrete Applied Mathematics, 103:307\u2013311, 2000.","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"T.A. McKee and F.R. McMorris. Topics in intersection graph theory. SIAM Monographs on D.M. and Applications, 1999.","DOI":"10.1137\/1.9780898719802"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"N. Robertson and P.D. Seymour. Graph minors. 1. excluding a forest. J. Combin. Theory Ser. B, 35:39\u201361, 1983.","journal-title":"J. Combin. Theory Ser. B"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1009759916586","volume":"1","author":"P.-J. Wan","year":"1997","unstructured":"P.-J. Wan. Near-optimal conflict-free channel set assignments for an optical clusterbased hypercube network. J. Combin. Optim., 1:179\u2013186, 1997.","journal-title":"J. Combin. Optim."}],"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\/3-540-45477-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:27:01Z","timestamp":1556756821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45477-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427070","9783540454779"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45477-2_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}