{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:12:13Z","timestamp":1742922733123,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_11","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"135-143","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Cycle Transverse Matching Problems"],"prefix":"10.1007","author":[{"given":"Ross","family":"Churchley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(94)00296-U","volume":"152","author":"A. Brandst\u00e4dt","year":"1986","unstructured":"Brandst\u00e4dt, A.: Partitions of graphs into one or two independent sets and cliques. Discrete Math.\u00a0152, 47\u201354 (1986)","journal-title":"Discrete Math."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canad. J. Math.\u00a017, 449\u2013467 (1965)","journal-title":"Canad. J. Math."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Farrugia, A.: Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard. Electron. J. Combin.\u00a011 (2004)","DOI":"10.7151\/dmgt.1234"},{"key":"11_CR4","unstructured":"Foldes, S., Hammer, P.L.: Split graphs. In: Proc. 8th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, pp. 311\u2013315 (1977)"},{"key":"11_CR5","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, San Francisco (1979)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput.\u00a05, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0012-365X(99)00300-3","volume":"216","author":"C.T. Ho\u00e1ng","year":"2000","unstructured":"Ho\u00e1ng, C.T., Le, V.C.: On P 4-transversals of perfect graphs. Discrete Math.\u00a0216, 195\u2013210 (2000)","journal-title":"Discrete Math."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.: An $O(\\sqrt{|V|}\\cdot|E|)$ algorithm for finding maximum matching in general graphs. In: Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"5548","DOI":"10.1016\/j.disc.2007.10.022","volume":"308","author":"J. Stacho","year":"2008","unstructured":"Stacho, J.: On P 4-transversals of chordal graphs. Discrete Math.\u00a0308, 5548\u20135554 (2008)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T04:00:25Z","timestamp":1560916825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}