{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:43:20Z","timestamp":1725482600328},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_18","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T12:13:55Z","timestamp":1176293635000},"page":"163-172","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Skew Partitions Efficiently"],"prefix":"10.1007","author":[{"given":"Celina M. H.","family":"de Figueiredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sulamita","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce A.","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N. Alon","year":"1992","unstructured":"Alon, N., Tarsi, M.: Colorings and orientations of graphs. Combinatorica\u00a012, 125\u2013134 (1992)","journal-title":"Combinatorica"},{"key":"18_CR2","first-page":"123","volume":"9","author":"C. Berge","year":"1960","unstructured":"Berge, C.: Les probl\u00e8mes de coloration en th\u00e9orie des graphes. Publ. Inst. Stat. Univ. Paris\u00a09, 123\u2013160 (1960)","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1002\/jgt.3190080106","volume":"8","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Recognizing decomposable graphs. J. Graph Theory\u00a08, 51\u201353 (1984)","journal-title":"J. Graph Theory"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","volume":"39","author":"V. Chv\u00e1tal","year":"1985","unstructured":"Chv\u00e1tal, V.: Star-Cutsets and perfect graphs. J. Combin. Theory Ser. B\u00a039, 189\u2013199 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jctb.1993.1065","volume":"59","author":"G. Cornu\u00e9jols","year":"1993","unstructured":"Cornu\u00e9jols, G., Reed, B.: Complete multi-partite cutsets in minimal imperfect graphs. J. Combin. Theory Ser. B\u00a059, 191\u2013198 (1993)","journal-title":"J. Combin. Theory Ser. B"},{"key":"18_CR6","first-page":"171","volume":"135","author":"H. Everett","year":"1998","unstructured":"Everett, H., Klein, S., Reed, B.: An optimal algorithm for finding clique-cross partitions. Congr. Numer.\u00a0135, 171\u2013177 (1998)","journal-title":"Congr. Numer."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jctb.1997.1812","volume":"72","author":"T. Feder","year":"1998","unstructured":"Feder, T., Hell, P.: List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B\u00a072, 236\u2013250 (1998)","journal-title":"J. Combin. Theory Ser. B"},{"key":"18_CR8","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms to bipartite graphs (manuscript)"},{"key":"18_CR9","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms to general graphs (manuscript)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of the thirty-first ACM Symposium on Theory of Computing, STOC 1999, pp. 464\u2013472 (1999)","DOI":"10.1145\/301250.301373"},{"key":"18_CR11","unstructured":"de Figueiredo, C.M.H., Klein, S., Kohayakawa, Y., Reed, B.: Finding Skew Partitions Efficiently. Technical Report ES-503\/99, COPPE\/UFRJ, Brazil, Available at \n                    \n                      ftp:\/\/ftp.cos.ufrj.br\/pub\/tech_reps\/es50399.ps.gz"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H. Fleischner","year":"1992","unstructured":"Fleischner, H., Stiebitz, M.: A solution of a coloring problem of P. Erd\u00f6s. Discrete Math.\u00a0101, 39\u201348 (1992)","journal-title":"Discrete Math."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of H-coloring. J. Combin. Theory Ser. B\u00a048, 92\u2013110 (1990)","journal-title":"J. Combin. Theory Ser. B"},{"key":"18_CR14","unstructured":"Ho\u00e0ng, C.T.: Perfect Graphs. Ph.D. Thesis, School of Computer Science, McGill University, Montreal (1985)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0166-218X(98)00124-3","volume":"91","author":"G. MacGillivray","year":"1999","unstructured":"MacGillivray, G., Yu, M.L.: Generalized partitions of graphs. Discrete Appl. Math.\u00a091, 143\u2013153 (1999)","journal-title":"Discrete Appl. Math."},{"key":"18_CR16","first-page":"216","volume":"119","author":"S. Klein","year":"1996","unstructured":"Klein, S., de Figueiredo, C.M.H.: The NP-completeness of multi-partite cutest testing. Congr. Numer.\u00a0119, 216\u2013222 (1996)","journal-title":"Congr. Numer."},{"key":"18_CR17","unstructured":"Vikas, N.: Computational complexity of graph compaction. In: Proceedings of the tenth ACM-SIAM Symposium on Discrete Algorithms, pp. 977\u2013978 (1999)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T11:40:32Z","timestamp":1567251632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10719839_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}