{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:19Z","timestamp":1758823939136},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf02579239","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T21:17:13Z","timestamp":1174598233000},"page":"315-323","source":"Crossref","is-referenced-by-count":16,"title":["Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs"],"prefix":"10.1007","volume":"2","author":[{"given":"Michael","family":"Stiebitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02579239_CR1","first-page":"165","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai, Kritische Graphen I,Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8 (1963), 165\u2013192.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"BF02579239_CR2","first-page":"373","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai, Kritische Graphen II.Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 8 (1963), 373\u2013395.","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"BF02579239_CR3","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz,Combinatorial Problems and Exercises, Akad. Kiad\u00f3, Budapest 1979."},{"key":"BF02579239_CR4","unstructured":"H. Sachs andM. Stiebitz, Construction of colour-critical graphs with given major-vertex subgraph,Proc. Int. Coll. Graph Theory and Combinatorics, Marseille-Luminy 1981,to appear."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579239.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579239\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579239","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:00Z","timestamp":1558197900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02579239"],"URL":"https:\/\/doi.org\/10.1007\/bf02579239","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}