{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:52:15Z","timestamp":1743141135637,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"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-02029-2_17","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T10:12:39Z","timestamp":1248689559000},"page":"172-182","source":"Crossref","is-referenced-by-count":0,"title":["Path-Bicolorable Graphs"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]},{"given":"Martin C.","family":"Golumbic","sequence":"additional","affiliation":[]},{"given":"Van Bang","family":"Le","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Lipshteyn","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","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.\u00a074, 33\u201349 (1989)","journal-title":"Discrete Math."},{"key":"17_CR2","doi-asserted-by":"publisher","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.\u00a055, 123\u2013128 (1985)","journal-title":"Discrete Math."},{"key":"17_CR3","doi-asserted-by":"publisher","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.\u00a021, 573\u2013591 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR4","doi-asserted-by":"publisher","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.\u00a017, 341\u2013360 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR5","doi-asserted-by":"publisher","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. Information Processing Letters\u00a098, 133\u2013138 (2006)","journal-title":"Information Processing Letters"},{"key":"17_CR6","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Math. Appl., vol.\u00a03. SIAM, Philadelphia (1999)"},{"key":"17_CR7","doi-asserted-by":"publisher","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\u00a069, 187\u2013203 (2002)","journal-title":"Computing"},{"key":"17_CR8","doi-asserted-by":"publisher","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. Annals of Mathematics\u00a064, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"key":"17_CR9","doi-asserted-by":"publisher","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.\u00a03, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"key":"17_CR10","doi-asserted-by":"publisher","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. Computing\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Computing"},{"key":"17_CR11","doi-asserted-by":"publisher","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.\u00a016, 635\u2013650 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR12","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"F\u00f6ldes, S., Hammer, P.L.: Split graphs. Congressus Numerantium\u00a019, 311\u2013315 (1977)","journal-title":"Congressus Numerantium"},{"key":"17_CR13","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0143, 221\u2013237 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR14","unstructured":"Ho\u00e0ng, C.T.: Perfect Graphs, Ph.D. Thesis, School of Computer Science, McGill University Montreal (1985)"},{"key":"17_CR15","doi-asserted-by":"publisher","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. Journal of Combinatorial Theory (B)\u00a042, 264\u2013273 (1987)","journal-title":"Journal of Combinatorial Theory (B)"},{"key":"17_CR16","first-page":"109","volume":"4","author":"C.T. Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng, C.T., Le, V.B.: P\n                4-free colorings and P\n                4-bipartite graphs. Discrete Math. and Theoretical Computer Science\u00a04, 109\u2013122 (2001)","journal-title":"Discrete Math. and Theoretical Computer Science"},{"key":"17_CR17","doi-asserted-by":"publisher","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. Journal Graph Theory\u00a013, 445\u2013463 (1989)","journal-title":"Journal Graph Theory"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison, B., Olariu, S.: P\n                4-reducible graphs\u2013a class of uniquely tree representable graphs. Studies in Appl. Math.\u00a081, 79\u201387 (1989)","journal-title":"Studies in Appl. Math."},{"key":"17_CR19","doi-asserted-by":"publisher","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\n                4-reducible graphs. Theoretical Computer Science\u00a0145, 329\u2013344 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: Recognizing P\n                4-sparse graphs in linear time. SIAM J. Computing\u00a021, 381\u2013406 (1992)","journal-title":"SIAM J. Computing"},{"key":"17_CR21","doi-asserted-by":"publisher","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.\u00a08, 448\u2013463 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR22","unstructured":"Kaiser, T.: Communication (2007)"},{"key":"17_CR23","unstructured":"Lipshteyn, M.: Structured Families of Graphs: Properties, Algorithms, and Representations, Ph.D. Thesis, University of Haifa (2005)"},{"key":"17_CR24","doi-asserted-by":"publisher","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.\u00a0201, 189\u2013241 (1999)","journal-title":"Discrete Math."},{"key":"17_CR25","doi-asserted-by":"publisher","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\u00a042, 69\u2013108 (2002)","journal-title":"J. Algorithms"},{"key":"17_CR26","doi-asserted-by":"publisher","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.\u00a061, 259\u2013267 (1986)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:37:00Z","timestamp":1578530220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_17"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}