{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:53:55Z","timestamp":1743130435279,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319644189"},{"type":"electronic","value":"9783319644196"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-64419-6_30","type":"book-chapter","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T22:42:00Z","timestamp":1502836920000},"page":"228-237","source":"Crossref","is-referenced-by-count":0,"title":["Partial Grundy Coloring in Some Subclasses of Bipartite Graphs and Chordal Graphs"],"prefix":"10.1007","author":[{"given":"B. S.","family":"Panda","sequence":"first","affiliation":[]},{"given":"Shaily","family":"Verma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,17]]},"reference":[{"issue":"8","key":"30_CR1","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1016\/j.disc.2013.01.018","volume":"313","author":"R Balakrishnan","year":"2013","unstructured":"Balakrishnan, R., Kavaskar, T.: Interpolation theorem for partial Grundy coloring. Discrete Math. 313(8), 949\u2013950 (2013)","journal-title":"Discrete Math."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0895480193253415","volume":"11","author":"A Brandst\u00e4dt","year":"1998","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Chepoi, V., Voloshin, V.I.: Dually chordal graphs. SIAM J. Discrete Math. 11, 437\u2013455 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","volume":"27","author":"CA Christen","year":"1979","unstructured":"Christen, C.A., Selkow, S.M.: Some perfect coloring properties of graphs. J. Combin. Theory Ser. B. 27, 49\u201359 (1979)","journal-title":"J. Combin. Theory Ser. B."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Effantin, B., Gastineau, N., Togni, O.: A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. Maths. arXiv:1505.07780v2 [cs.DM] (2016)","DOI":"10.1016\/j.disc.2016.03.011"},{"issue":"1","key":"30_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0012-365X(03)00184-5","volume":"272","author":"P Erd\u00f6s","year":"2003","unstructured":"Erd\u00f6s, P., Hedetniemi, S.T., Laskar, R.C., Prins, G.C.E.: On the equality of the partial Grundy and upper ochromatic numbers of graphs. Discrete Math. 272(1), 53\u201364 (2003)","journal-title":"Discrete Math."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific J. Math. 15, 835\u2013855 (1965)","journal-title":"Pacific J. Math."},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1002\/jgt.3190020209","volume":"2","author":"MC Golumbic","year":"1978","unstructured":"Golumbic, M.C., Goss, C.F.: Perfect elimination and chordal bipartite graphs. J. Graph Theory. 2, 155\u2013163 (1978)","journal-title":"J. Graph Theory."},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.disc.2005.09.008","volume":"304","author":"Z Shi","year":"2005","unstructured":"Shi, Z., Goddard, W., Hedetniemi, S.T., Kennedy, K., Laskar, R., McRae, A.: An algorithm for partial Grundy number on trees. Discrete Math. 304, 108\u2013116 (2005)","journal-title":"Discrete Math."},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/978-3-540-30551-4_74","volume-title":"Algorithms and Computation","author":"R Uehara","year":"2004","unstructured":"Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 871\u2013883. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30551-4_74"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science and Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64419-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T08:38:52Z","timestamp":1570005532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64419-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319644189","9783319644196"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64419-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}