{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:10:52Z","timestamp":1725793852006},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_34","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"404-415","source":"Crossref","is-referenced-by-count":1,"title":["Claw-Free t-Perfect Graphs Can Be Recognised in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Henning","family":"Bruhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Schaudt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0012-365X(79)90160-2","volume":"27","author":"M. Boulala","year":"1979","unstructured":"Boulala, M., Uhry, J.P.: Polytope des ind\u00e9pendants d\u2019un graphe s\u00e9rie-parall\u00e8le. Disc. Math.\u00a027, 225\u2013243 (1979)","journal-title":"Disc. Math."},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/090769508","volume":"24","author":"H. Bruhn","year":"2010","unstructured":"Bruhn, H., Stein, M.: t-perfection is always strong for claw-free graphs. SIAM. J. Discrete Math.\u00a024, 770\u2013781 (2010)","journal-title":"SIAM. J. Discrete Math."},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-010-0436-9","volume":"133","author":"H. Bruhn","year":"2012","unstructured":"Bruhn, H., Stein, M.: On claw-free t-perfect graphs. Math.\u00a0Program.\u00a0133, 461\u2013480 (2012)","journal-title":"Math.\u00a0Program."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M. Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., Vu\u0161kovi\u0107, K.: Recognizing berge graphs. Combinatorica\u00a025, 143\u2013187 (2005)","journal-title":"Combinatorica"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Seymour, P., Robertson, N., Thomas, R.: The strong perfect graph theorem. Ann. Math.\u00a0164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: On certain polytopes associated with graphs. J.\u00a0Combin. Theory (Series B)\u00a018, 138\u2013154 (1975)","journal-title":"J.\u00a0Combin. Theory (Series B)"},{"key":"34_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 3rd edn. MIT Press (2009)"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph theory, 4th edn. Springer (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"34_CR9","unstructured":"Eisenbrand, F., Funke, S., Garg, N., K\u00f6nemann, J.: A combinatorial algorithm for computing a maximum independent set in a t-perfect graph. In: SODA, pp. 517\u2013522 (2002)"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"M.R. Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochvil, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica\u00a013, 266\u2013282 (1995)","journal-title":"Algorithmica"},{"key":"34_CR11","first-page":"83","volume":"16","author":"J. Fonlupt","year":"1982","unstructured":"Fonlupt, J., Uhry, J.P.: Transformations which preserve perfectness and h-perfectness of graphs. Ann. Disc. Math.\u00a016, 83\u201395 (1982)","journal-title":"Ann. Disc. Math."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/S0895480196306361","volume":"11","author":"A.M.H. Gerards","year":"1998","unstructured":"Gerards, A.M.H., Shepherd, F.B.: The graphs with all subgraphs t-perfect. SIAM J. Discrete Math.\u00a011, 524\u2013545 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR13","unstructured":"Golovach, P.A., Paulusma, D., van Leeuwen, E.J.: Induced disjoint paths in claw-free graphs, arXiv:1202.4419v1"},{"key":"34_CR14","unstructured":"Huynh, T.C.T.: The linkage problem for group-labelled graphs, PhD thesis, University of Waterloo (2009)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B., Wollan, P.: The graph minor algorithm with parity conditions. In: FOCS, pp. 27\u201336 (2011)","DOI":"10.1109\/FOCS.2011.52"},{"key":"34_CR16","unstructured":"Kir\u00e1ly, T., P\u00e1p, J.: A note on kernels in h-perfect graphs, Tech. Report TR-2007-03, Egerv\u00e1ry Research Group (2007)"},{"key":"34_CR17","unstructured":"Kir\u00e1ly, T., P\u00e1p, J.: Kernels, stable matchings and Scarf\u2019s Lemma, Tech. Report TR-2008-13, Egerv\u00e1ry Research Group (2008)"},{"key":"34_CR18","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/S0895480104442522","volume":"19","author":"F. Maffray","year":"2005","unstructured":"Maffray, F., Trotignon, N.: Algorithms for perfectly contractile graphs. SIAM J.\u00a0Discrete Math.\u00a019, 553\u2013574 (2005)","journal-title":"SIAM J.\u00a0Discrete Math."},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/BF01580235","volume":"6","author":"M.W. Padberg","year":"1974","unstructured":"Padberg, M.W.: Perfect zero-one matrices. Math.\u00a0Programming\u00a06, 180\u2013196 (1974)","journal-title":"Math.\u00a0Programming"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"N.D. Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max {m, n } algorithm for determining the graph H from its line graph G. Inf. Process. Lett.\u00a02, 108\u2013112 (1973)","journal-title":"Inf. Process. Lett."},{"key":"34_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(84)90071-2","volume":"51","author":"N. Sbihi","year":"1984","unstructured":"Sbihi, N., Uhry, J.P.: A class of h-perfect graphs. Disc. Math.\u00a051, 191\u2013205 (1984)","journal-title":"Disc. Math."},{"key":"34_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480101401101","volume":"15","author":"A. Schrijver","year":"2002","unstructured":"Schrijver, A.: Strong t-perfection of bad-K\n                4-free graphs. SIAM J. Discrete Math.\u00a015, 403\u2013415 (2002)","journal-title":"SIAM J. Discrete Math."},{"key":"34_CR23","unstructured":"Schrijver, A.: Combinatorial optimization. In: Polyhedra and efficiency. Springer (2003)"},{"key":"34_CR24","first-page":"353","volume":"71","author":"F.B. Shepherd","year":"1995","unstructured":"Shepherd, F.B.: Applying Lehman\u2019s theorems to packing problems. Math. Prog.\u00a071, 353\u2013367 (1995)","journal-title":"Math. Prog."},{"key":"34_CR25","doi-asserted-by":"crossref","unstructured":"van \u2019t Hof, P., Kami\u0144ski, M., Paulusma, D.: Finding induced paths of given parity in claw-free graphs. Algorithmica\u00a062, 537\u2013563 (2012)","DOI":"10.1007\/s00453-010-9470-5"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:19:01Z","timestamp":1558905541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}