{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T07:12:35Z","timestamp":1726384355844},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T00:00:00Z","timestamp":1478822400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10107-016-1085-4","type":"journal-article","created":{"date-parts":[[2016,11,11]],"date-time":"2016-11-11T07:02:44Z","timestamp":1478847764000},"page":"245-262","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Integer round-up property for the chromatic number of some h-perfect graphs"],"prefix":"10.1007","volume":"164","author":[{"given":"Yohann","family":"Benchetrit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,11]]},"reference":[{"key":"1085_CR1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","volume":"2","author":"S Baum","year":"1981","unstructured":"Baum, S., Trotter, L.E.J.: Integer rounding for polymatroid and branching optimization problems. SIAM J. Algebraic Discrete Methods 2, 416\u2013425 (1981)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"1085_CR2","unstructured":"Benchetrit, Y., Seb\u0151, A.: Ear-Decompositions and the Complexity of the Matching Polytope. arXiv preprint arXiv:1509.05586 (2015)"},{"key":"1085_CR3","doi-asserted-by":"crossref","unstructured":"Bruhn, H., Schaudt, O.: Claw-free t-perfect graphs can be recognised in polynomial time. In: Lee, J., Vygen, J. (eds.) Integer programming and combinatorial optimization, pp. 404\u2013415. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-07557-0_34"},{"issue":"1\u20132","key":"1085_CR4","doi-asserted-by":"crossref","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. Program. 133(1\u20132), 461\u2013480 (2012)","journal-title":"Math. Program."},{"key":"1085_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0166-218X(97)00081-4","volume":"81","author":"D Cao","year":"1998","unstructured":"Cao, D., Nemhauser, G.L.: Polyhedral characterizations and perfection of line graphs. Discrete Appl. Math. 81, 141\u2013154 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"1085_CR6","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.jctb.2012.07.005","volume":"102","author":"M Chudnovsky","year":"2012","unstructured":"Chudnovsky, M., Seymour, P.: Claw-free graphs. VII. Quasi-line graphs. J. Comb. Theory Ser. B 102(6), 1267\u20131294 (2012)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1085_CR7","doi-asserted-by":"crossref","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. Comb. Theory Ser. B 18, 138\u2013154 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1085_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume-title":"Polyhedral Combinatorics, Mathematical Programming Studies","author":"W Cunningham","year":"1978","unstructured":"Cunningham, W., Marsh, A.: A primal algorithm for optimum matching. In: Balinski, M., Hoffman, A. (eds.) Polyhedral Combinatorics, Mathematical Programming Studies, vol. 8, pp. 50\u201372. Springer, Berlin (1978)"},{"issue":"4","key":"1085_CR9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/(SICI)1097-0118(199612)23:4<365::AID-JGT6>3.0.CO;2-P","volume":"23","author":"WA Deuber","year":"1996","unstructured":"Deuber, W.A., Zhu, X.: Circular colorings of weighted graphs. J. Graph Theory 23(4), 365\u2013376 (1996)","journal-title":"J. Graph Theory"},{"key":"1085_CR10","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with $$0,1$$ 0 , 1 vertices. J. Res. Nat. Bur. Stand. 69 B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Stand."},{"issue":"5","key":"1085_CR11","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1016\/j.ejc.2011.09.016","volume":"33","author":"F Eisenbrand","year":"2012","unstructured":"Eisenbrand, F., Niemeier, M.: Coloring fuzzy circular interval graphs. Eur. J. Comb. 33(5), 893\u2013904 (2012)","journal-title":"Eur. J. Comb."},{"key":"1085_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-0208(08)72445-9","volume":"66","author":"J Fonlupt","year":"1982","unstructured":"Fonlupt, J., Uhry, J.: Transformations which preserve perfectness and h-perfectness of graphs. N.-Holl. Math. Stud. 66, 83\u201395 (1982)","journal-title":"N.-Holl. Math. Stud."},{"issue":"1","key":"1085_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D Fulkerson","year":"1972","unstructured":"Fulkerson, D.: Anti-blocking polyhedra. J. Comb. Theory Ser. B 12(1), 50\u201371 (1972)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1085_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.1715","volume":"69","author":"A Galluccio","year":"1997","unstructured":"Galluccio, A., Sassano, A.: The rank facets of the stable set polytope for claw-free graphs. J. Comb. Theory Ser. B 69(1), 1\u201338 (1997)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"1085_CR15","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1137\/S0895480196306361","volume":"11","author":"A Gerards","year":"1998","unstructured":"Gerards, A., Shepherd, B.: The graphs with all subgraphs t-perfect. SIAM J. Discrete Math. 11(4), 524\u2013545 (1998)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"1085_CR16","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"40","author":"M Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Relaxations of vertex packing. J. Comb. Theory Ser. B 40(3), 330\u2013343 (1986)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1085_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer, Berlin (1988)"},{"key":"1085_CR18","volume-title":"Graph Theory","author":"F Harary","year":"1972","unstructured":"Harary, F.: Graph Theory. Addison Wesley, Salt Lake City (1972)"},{"issue":"4","key":"1085_CR19","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The np-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1085_CR20","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L Lov\u00e1sz","year":"1972","unstructured":"Lov\u00e1sz, L.: Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(3), 253\u2013267 (1972)","journal-title":"Discrete Math."},{"issue":"3","key":"1085_CR21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G Minty","year":"1980","unstructured":"Minty, G.: On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B 28(3), 284\u2013304 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"1085_CR22","doi-asserted-by":"crossref","first-page":"194","DOI":"10.15807\/jorsj.44.194","volume":"44","author":"D Nakamura","year":"2001","unstructured":"Nakamura, D., Tamura, A.: A revision of Minty\u2019s algorithm for finding a maximum weight stable set of a claw-free graph. J. Oper. Res. Soc. Jpn. 44(2), 194\u2013204 (2001)","journal-title":"J. Oper. Res. Soc. Jpn."},{"issue":"1\u20132","key":"1085_CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10107-012-0512-4","volume":"141","author":"A P\u00eacher","year":"2013","unstructured":"P\u00eacher, A., Wagler, A.K.: Computing clique and chromatic number of circular-perfect graphs in polynomial time. Math. Program. 141(1\u20132), 121\u2013133 (2013)","journal-title":"Math. Program."},{"key":"1085_CR24","volume-title":"Combinatorial Optimization\u2014Polyhedra and Efficiency, Algorithms and Combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization\u2014Polyhedra and Efficiency, Algorithms and Combinatorics, vol. 24. Springer, Berlin (2003)"},{"key":"1085_CR25","first-page":"353","volume":"71","author":"FB Shepherd","year":"1995","unstructured":"Shepherd, F.B.: Applying Lehman\u2019s theorems to packing problems. Math. Program. 71, 353\u2013367 (1995)","journal-title":"Math. Program."},{"key":"1085_CR26","volume-title":"Graph Edge Coloring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture","author":"M Stiebitz","year":"2012","unstructured":"Stiebitz, M., Scheide, D., Favrholdt, L.: Graph Edge Coloring: Vizing\u2019s Theorem and Goldberg\u2019s Conjecture. Wiley, New York (2012)"},{"issue":"4","key":"1085_CR27","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1002\/jgt.3190120411","volume":"12","author":"A Vince","year":"1988","unstructured":"Vince, A.: Star chromatic number. J. Graph Theory 12(4), 551\u2013559 (1988)","journal-title":"J. Graph Theory"},{"key":"1085_CR28","unstructured":"Wagler, A.: Relaxing perfectness. Technical Report, ZIB (2002)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1085-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1085-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1085-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T09:50:30Z","timestamp":1568541030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1085-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,11]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1085-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,11]]}}}