{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:35:44Z","timestamp":1725525344604},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_11","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T07:34:01Z","timestamp":1234251241000},"page":"117-128","source":"Crossref","is-referenced-by-count":1,"title":["Colinear Coloring on Graphs"],"prefix":"10.1007","author":[{"given":"Kyriaki","family":"Ioannidou","sequence":"first","affiliation":[]},{"given":"Stavros D.","family":"Nikolopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1145\/322003.322005","volume":"24","author":"F.T. Boesch","year":"1977","unstructured":"Boesch, F.T., Gimpel, J.F.: Covering the points of a digraph with point-disjoint paths and its application to code optimization. J. of the ACM\u00a024, 192\u2013198 (1977)","journal-title":"J. of the ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Proc. Cambridge Phil. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"I","author":"V. Chv\u00e1tal","year":"1977","unstructured":"Chv\u00e1tal, V., Hammer, P.L.: Aggregation of inequalities for integer programming. Ann. Discrete Math.\u00a0I, 145\u2013162 (1977)","journal-title":"Ann. Discrete Math."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1016\/j.jcta.2007.02.001","volume":"114","author":"Y. Civan","year":"2007","unstructured":"Civan, Y., Yal\u00e7in, E.: Linear colorings of simplicial complexes and collapsing. J. Comb. Theory A\u00a0114, 1315\u20131331 (2007)","journal-title":"J. Comb. Theory A"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.jcta.2004.06.004","volume":"108","author":"P. Csorba","year":"2004","unstructured":"Csorba, P., Lange, C., Schurr, I., Wassmer, A.: Box complexes, neighborhood complexes, and the chromatic number. J. Comb. Theory A\u00a0108, 159\u2013168 (2004)","journal-title":"J. Comb. Theory A"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980); annals of Discrete Mathematics, 2nd edn., vol. 57. Elsevier (2004)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.M.: A n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Computing"},{"key":"11_CR9","first-page":"2","volume":"58","author":"M. Kneser","year":"1955","unstructured":"Kneser, M.: Aufgabe 300. Jahresbericht der Deutschen Mathematiker-Vereinigung\u00a058, 2 (1955)","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L. Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic numbers and homotopy. J. Comb. Theory A\u00a025, 319\u2013324 (1978)","journal-title":"J. Comb. Theory A"},{"key":"11_CR11","first-page":"71","volume":"106","author":"J. Matou\u0161ek","year":"2004","unstructured":"Matou\u0161ek, J., Ziegler, G.M.: Topological lower bounds for the chromatic number: a hierarchy. Jahresbericht der Deutschen Mathematiker-Vereinigung\u00a0106, 71\u201390 (2004)","journal-title":"Jahresbericht der Deutschen Mathematiker-Vereinigung"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0020-0190(00)00041-7","volume":"74","author":"S.D. Nikolopoulos","year":"2000","unstructured":"Nikolopoulos, S.D.: Recognizing cographs and threshold graphs through a classification of their edges. Inform. Proc. Lett.\u00a074, 129\u2013139 (2000)","journal-title":"Inform. Proc. Lett."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s002220100188","volume":"147","author":"G.M. Ziegler","year":"2002","unstructured":"Ziegler, G.M.: Generalised Kneser coloring theorems with combinatorial proofs. Inventiones mathematicae\u00a0147, 671\u2013691 (2002)","journal-title":"Inventiones mathematicae"}],"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-642-00202-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T23:07:33Z","timestamp":1558134453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00202-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}