{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:25:51Z","timestamp":1648837551355},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s00373-010-1007-9","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T03:12:52Z","timestamp":1294110772000},"page":"799-819","source":"Crossref","is-referenced-by-count":0,"title":["Path-Bicolorable Graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Martin Charles","family":"Golumbic","sequence":"additional","affiliation":[]},{"given":"Van Bang","family":"Le","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Lipshteyn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"key":"1007_CR1","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","volume":"74","author":"M.O. Albertson","year":"1989","unstructured":"Albertson M.O., Jamison R.E., Hedetniemi S.T., Locke S.C.: The subchromatic number of a graph. Discrete Math. 74, 33\u201349 (1989)","journal-title":"Discrete Math."},{"key":"1007_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0012-365X(85)90040-8","volume":"55","author":"C. Benzaken","year":"1985","unstructured":"Benzaken C., Hammer P.L., de Werra D.: Split graphs of Dilworth number 2. Discrete Math. 55, 123\u2013128 (1985)","journal-title":"Discrete Math."},{"key":"1007_CR3","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1137\/050637091","volume":"21","author":"A. Berry","year":"2007","unstructured":"Berry A., Golumbic M.C., Lipshteyn M.: Recognizing chordal probe graphs and cycle-bicolorable graphs. SIAM J. Discrete Math. 21, 573\u2013591 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1007_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/S0895480100367676","volume":"17","author":"A. Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt A., Le V.B.: Split-perfect graphs: characterizations and algorithmic use. SIAM J. Discrete Math. 17, 341\u2013360 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"1007_CR5","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ipl.2006.01.004","volume":"98","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt A., Le V.B.: Structure and linear time recognition of 3-leaf powers. Inf. Process. Lett. 98, 133\u2013138 (2006)","journal-title":"Inf. Process. Lett."},{"key":"1007_CR6","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: SIAM Monographs on Discrete Math. Appl., vol. 3. SIAM, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"1007_CR7","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00607-002-1461-1","volume":"69","author":"H. Broersma","year":"2002","unstructured":"Broersma H., Fomin F.V., Ne\u0161et\u0159il J., Woeginger G.: More about subcolorings. Computing 69, 187\u2013203 (2002)","journal-title":"Computing"},{"key":"1007_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"64","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky M., Robertson N., Seymour P., Thomas R.: The strong perfect graph theorem. Ann. Math. 64, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"1007_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil D.G., Lerchs H., Stewart-Burlingham L.: Complement reducible graphs. Discrete Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"1007_CR10","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil D.G., Perl Y., Stewart L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"1007_CR11","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1137\/S0895480101395245","volume":"16","author":"J. Fiala","year":"2003","unstructured":"Fiala J., Jansen K., Le V.B., Seidel E.: Graph subcolorings: complexity and algorithms. SIAM J. Discrete Math. 16, 635\u2013650 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"1007_CR12","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes S., Hammer P.L.: Split graphs. Congressus Numerantium 19, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"1007_CR13","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.dam.2003.12.009","volume":"143","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic M.C., Lipshteyn M.: Chordal probe graphs. Discrete Appl. Math. 143, 221\u2013237 (2004)","journal-title":"Discrete Appl. Math."},{"key":"1007_CR14","unstructured":"Ho\u00e0ng, C.T.: Perfect graphs. Ph.D. thesis, School of Computer Science, McGill University Montreal (1985)"},{"key":"1007_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0095-8956(87)90045-1","volume":"42","author":"C.T. Ho\u00e0ng","year":"1987","unstructured":"Ho\u00e0ng C.T.: Alternating orientation and alternating colouration of perfect graphs. J. Combin. Theory (B) 42, 264\u2013273 (1987)","journal-title":"J. Combin. Theory (B)"},{"key":"1007_CR16","first-page":"109","volume":"4","author":"C.T. Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng C.T., Le V.B.: P 4-free colorings and P 4-bipartite graphs. Discrete Math. Theor. Comput. Sci. 4, 109\u2013122 (2001)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1007_CR17","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190130407","volume":"13","author":"C.T. Ho\u00e0ng","year":"1989","unstructured":"Ho\u00e0ng C.T., Reed B.A.: Some classes of perfectly orderable graphs. J. Graph Theory 13, 445\u2013463 (1989)","journal-title":"J. Graph Theory"},{"key":"1007_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison B., Olariu S.: P 4-reducible graphs\u2014a class of uniquely tree representable graphs. Stud. Appl. Math. 81, 79\u201387 (1989)","journal-title":"Stud. Appl. Math."},{"key":"1007_CR19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","volume":"145","author":"B. Jamison","year":"1995","unstructured":"Jamison B., Olariu S.: A linear-time recognition algorithm for P 4-reducible graphs. Theor. Comput. Sci. 145, 329\u2013344 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"1007_CR20","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison B., Olariu S.: Recognizing P 4-sparse graphs in linear time. SIAM J. Comput. 21, 381\u2013406 (1992)","journal-title":"SIAM J. Comput."},{"key":"1007_CR21","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","volume":"8","author":"B. Jamison","year":"1995","unstructured":"Jamison B., Olariu S.: p-Components and the homogeneous decomposition of graphs. SIAM J. Discrete Math. 8, 448\u2013463 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"1007_CR22","unstructured":"Lipshteyn, M.: Structured families of graphs: properties, algorithms, and representations. Ph.D. thesis, University of Haifa (2005)"},{"key":"1007_CR23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell R.M., Spinrad J.P.: Modular decomposition and transitive orientation. Discrete Math. 201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"1007_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/jagm.2001.1195","volume":"42","author":"N. Nishimura","year":"2002","unstructured":"Nishimura N., Ragde P., Thilikos D.M.: On graph powers for leaf-labeled trees. J. Algorithms 42, 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"key":"1007_CR25","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0012-365X(86)90097-X","volume":"61","author":"M. Preissmann","year":"1986","unstructured":"Preissmann M., de Werra D., Mahadev N.V.R.: A note on superbrittle graphs. Discrete Math. 61, 259\u2013267 (1986)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-1007-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-010-1007-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-010-1007-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T10:47:22Z","timestamp":1559904442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-010-1007-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["1007"],"URL":"https:\/\/doi.org\/10.1007\/s00373-010-1007-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}