{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:08Z","timestamp":1742912708412,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"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-02026-1_22","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"238-248","source":"Crossref","is-referenced-by-count":0,"title":["Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge"],"prefix":"10.1007","author":[{"given":"Jixing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0012-365X(92)90354-I","volume":"102","author":"J.I. Brown","year":"1992","unstructured":"Brown, J.I.: A Vertex Critical Graph without Critical Edges. Discrete Math.\u00a0102, 99\u2013101 (1992)","journal-title":"Discrete Math."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0167-5060(08)70454-0","volume-title":"Graph Thoery in Memory of G.A. Dirac, Annals of Discrete Mathmatics","author":"P. Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P.: On Some Aspects of My Work with Gabriel Dirac. In: Andersen, L.D., Jakobsen, I.T., Thomassen, C., Toft, B., Vestergaard, P.D. (eds.) Graph Thoery in Memory of G.A. Dirac, Annals of Discrete Mathmatics, vol.\u00a041, pp. 111\u2013116. North-Holland, Amsterdam (1989)"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0012-365X(02)00262-5","volume":"258","author":"T.R. Jensen","year":"2002","unstructured":"Jensen, T.R.: Dense Critical and Vertex-Critical Graphs. Discrete Math.\u00a0258, 63\u201384 (2002)","journal-title":"Discrete Math."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1002\/jgt.3190190111","volume":"19","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Royle, G.F.: Small Graphs of Chromatic Number 5: A Computer Search. J. Graph Theory\u00a019, 107\u2013116 (1995)","journal-title":"J. Graph Theory"},{"key":"22_CR5","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0012-365X(02)00394-1","volume":"258","author":"J.J. Lattanzio","year":"2002","unstructured":"Lattanzio, J.J.: A Note on a Conjecture of Dirac. Discrete Math.\u00a0258, 323\u2013330 (2002)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:55:53Z","timestamp":1714622153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}