{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:47Z","timestamp":1759637987144},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s10878-005-4103-7","type":"journal-article","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T08:26:20Z","timestamp":1131870380000},"page":"211-225","source":"Crossref","is-referenced-by-count":10,"title":["On Split-Coloring Problems"],"prefix":"10.1007","volume":"10","author":[{"given":"T.","family":"Ekim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"de Werra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4103_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(85)90040-8","volume":"55","author":"C. Benzaken","year":"1985","unstructured":"C. Benzaken, P. Hammer, and D. de Werra, \u201cSplit graphs of Dilworth number 2,\u201d Discrete Mathematics, vol. 55, pp. 123\u2013127, 1985.","journal-title":"Discrete Mathematics"},{"key":"4103_CR2","volume-title":"Graphes","author":"C. Berge","year":"1983","unstructured":"C. Berge, Graphes, Bordas, Paris, 1983."},{"key":"4103_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0166-218X(98)00116-4","volume":"89","author":"A. Brandst\u00e4dt","year":"1998","unstructured":"A. Brandst\u00e4dt, V. Le, and T. Szymczak, \u201cThe complexity of some problems related to graph 3-colorability,\u201d Discrete Applied Mathematics, vol. 89, pp. 59\u201373, 1998.","journal-title":"Discrete Applied Mathematics"},{"key":"4103_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(91)90394-H","volume":"89","author":"Z.A. Chernyak","year":"1991","unstructured":"Z.A. Chernyak and A. Chernyak, \u201cSplit dimension of graphs,\u201d Discrete Mathematics, vol. 89, pp. 1\u20136, 1991.","journal-title":"Discrete Mathematics"},{"key":"4103_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.dam.2004.06.016","volume":"146","author":"D. de Werra","year":"2005","unstructured":"D. de Werra, M. Demange, J. Monnot, and V. Paschos, \u201cA hypocoloring model for batch scheduling,\u201d Discrete Applied Mathematics, vol. 146, pp. 3\u201326, 2005.","journal-title":"Discrete Applied Mathematics"},{"key":"4103_CR6","doi-asserted-by":"crossref","unstructured":"G. Dirac, \u201cOn rigid circuit graphs,\u201d Abh. Math. Sem. Univ. Hamburg, no. 25, pp. 71\u201376, 1961.","DOI":"10.1007\/BF02992776"},{"key":"4103_CR7","unstructured":"S. F\u00f6ldes and P. Hammer, \u201cOn split graphs and some related questions,\u201d in Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay, France, Colloques Internationnaux C.N.R.S. 260, 1976, pp. 139\u2013140."},{"key":"4103_CR8","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"S. F\u00f6ldes and P. Hammer, \u201cSplit graphs,\u201d Congressum Numerantium, vol. 19, pp. 311\u2013315, 1977.","journal-title":"Congressum Numerantium"},{"key":"4103_CR9","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"D. Fulkerson","year":"1965","unstructured":"D. Fulkerson and O. Gross, \u201cIncidence matrixes and interval graphs,\u201d Pacific Journal of Math., vol. 15, pp. 835\u2013855, 1965.","journal-title":"Pacific Journal of Math."},{"key":"4103_CR10","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"F. Gavril, \u201cAlgorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independant set of a chordal graph,\u201d SIAM J. Comput., vol. 1, pp. 180\u2013187, 1972.","journal-title":"SIAM J. Comput."},{"key":"4103_CR11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-642-56082-8_9","volume-title":"Facility location","author":"E. Gourdin","year":"2002","unstructured":"E. Gourdin, M. Labb\u00e9, and H. Yaman, \u201cTelecommunication and location,\u201d in Facility location, Springer, Berlin, 2002, pp. 275\u2013305."},{"key":"4103_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P. Hammer","year":"1981","unstructured":"P. Hammer and B. Simeone, \u201cThe splittance of a graph,\u201d Combinatorica, vol. 1, pp. 275\u2013284, 1981.","journal-title":"Combinatorica"},{"key":"4103_CR13","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0166-218X(03)00371-8","volume":"141","author":"P. Hell","year":"2004","unstructured":"P. Hell, S. Klein, L. Nogueira, and F. Protti, \u201cPartitioning chordal graphs into independent sets and cliques,\u201d Discrete Applied Mathematics, vol. 141, pp. 185\u2013194, 2004.","journal-title":"Discrete Applied Mathematics"},{"key":"4103_CR14","unstructured":"N. Mahadev and U. Peled, Threshold Graphs and Related Topics, Ann. Disc. Mat., North-Holland, vol. 56, 1995."},{"key":"4103_CR15","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, \u201cDepth first search and linear graph algorithms,\u201d SIAM J. Comput., vol. 1, pp. 146\u2013160, 1972.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4103_CR16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1137\/0214020","volume":"14","author":"R.E. Tarjan","year":"1985","unstructured":"R.E. Tarjan and M. Yannakakis, \u201cAddendum: Simple linear time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs,\u201d SIAM J. Comput., vol. 14, no. 1, pp. 254\u2013255, 1985.","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4103-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-4103-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4103-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:59:04Z","timestamp":1586552344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-4103-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["4103"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-4103-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}