{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:00:02Z","timestamp":1776790802602,"version":"3.51.2"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5191,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s0166-218x(99)00021-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"193-203","source":"Crossref","is-referenced-by-count":32,"title":["On the deficiency of bipartite graphs"],"prefix":"10.1016","volume":"94","author":[{"given":"Krzysztof","family":"Giaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Kubale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Ma\u0142afiejski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00021-9_BIB1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1006\/jctb.1994.1053","article-title":"Investigation on interval edge-colorings of graphs","volume":"62","author":"Asratian","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(99)00021-9_BIB2","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1287\/opre.38.6.951","article-title":"Scheduling interviews for a job fair","volume":"38","author":"Bartholdi","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB3","first-page":"287","article-title":"The complexity of consecutive \u0394-coloring of bipartite graphs: 4 is easy, 5 is hard","volume":"47","author":"Giaro","year":"1997","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB4","doi-asserted-by":"crossref","unstructured":"K. Giaro, M. Kubale, M. Ma\u0142afiejski, Consecutive colorings of the edges of general graphs. Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(00)00437-4"},{"key":"10.1016\/S0166-218X(99)00021-9_BIB5","first-page":"29","article-title":"No-wait open shop scheduling of zero-one time operations without inserted idle times (in Polish)","volume":"117","author":"Giaro","year":"1996","journal-title":"Zesz. Nauk. Pol. \u015al., Ser. Automat."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB6","first-page":"69","article-title":"A lower bound for interval colouring of bi-regular bipartite graphs","volume":"18","author":"Hanson","year":"1996","journal-title":"Bull. Inst. Comb. Appl."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB7","unstructured":"D. Hanson, C.O.M. Loten, B. Toft, On interval colorings of bi-regular bipartite graphs. Ars Combin., to appear."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB8","series-title":"Email information","author":"Hertz","year":"1995"},{"key":"10.1016\/S0166-218X(99)00021-9_BIB9","first-page":"203","article-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0166-218X(99)00021-9_BIB10","series-title":"Interval coloring of complete bipartite graphs and trees (in Russian)","author":"Kamalian","year":"1989"},{"key":"10.1016\/S0166-218X(99)00021-9_BIB11","first-page":"61","article-title":"On interval colorability of a bipartite graph (in Russian)","volume":"50","author":"Sevastjanov","year":"1990","journal-title":"Met. Diskret Analiz."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB12","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph (in Russian)","volume":"3","author":"Vizing","year":"1964","journal-title":"Met. Diskret. Analiz."},{"key":"10.1016\/S0166-218X(99)00021-9_BIB13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF02248592","article-title":"Almost nonpreemptive schedules","volume":"26","author":"de Werra","year":"1990","journal-title":"Ann. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000219?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99000219?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:53:39Z","timestamp":1556132019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99000219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,5]]}},"alternative-id":["S0166218X99000219"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00021-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}