{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:56Z","timestamp":1759638716587},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,12,29]],"date-time":"2011-12-29T00:00:00Z","timestamp":1325116800000},"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":[[2013,5]]},"DOI":"10.1007\/s00373-011-1123-1","type":"journal-article","created":{"date-parts":[[2011,12,28]],"date-time":"2011-12-28T09:14:13Z","timestamp":1325063653000},"page":"553-567","source":"Crossref","is-referenced-by-count":9,"title":["Recognizing Well Covered Graphs of Families with Special P 4-Components"],"prefix":"10.1007","volume":"29","author":[{"given":"S.","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. P.","family":"de Mello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Morgana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,29]]},"reference":[{"key":"1123_CR1","unstructured":"Baumann, S.: A linear algorithm for the homogeneous decomposition of graphs. Report No. M-9615, Zentrum Mathematik, Technische Universit\u00e4t M\u00fcnchen (1996)"},{"key":"1123_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<85::AID-JGT6>3.0.CO;2-E","volume":"25","author":"Y. Caro","year":"1997","unstructured":"Caro Y.: Subdivisions, parity and well-covered graphs. J. Graph Theory 25, 85\u201394 (1997)","journal-title":"J. Graph Theory"},{"key":"1123_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1006\/jagm.1996.0006","volume":"20","author":"Y. Caro","year":"1996","unstructured":"Caro Y., Seb\u00f6 A., Tarsi M.: Recognizing greedy structures. J. Algorithms 20, 137\u2013156 (1996)","journal-title":"J. Algorithms"},{"key":"1123_CR4","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-5060(08)70387-X","volume":"55","author":"V. Chv\u00e1tal","year":"1993","unstructured":"Chv\u00e1tal V., Slater P.J.: A note on well-covered graphs. Ann. Discrete Math. 55, 179\u2013182 (1993)","journal-title":"Ann. Discrete Math."},{"key":"1123_CR5","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":"1123_CR6","first-page":"249","volume":"43","author":"D.G. Corneil","year":"1984","unstructured":"Corneil D.G., Perl Y., Stewart L.K.: Cographs: recognition, applications and algorithms. Congressus Numerantium 43, 249\u2013258 (1984)","journal-title":"Congressus Numerantium"},{"key":"1123_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(94)90253-4","volume":"126","author":"N. Dean","year":"1994","unstructured":"Dean N., Zito J.: Well covered graphs and extendability. Discrete Math. 126, 67\u201380 (1994)","journal-title":"Discrete Math."},{"issue":"1","key":"1123_CR8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.disc.2007.12.083","volume":"309","author":"A.O. Fradkin","year":"2009","unstructured":"Fradkin A.O.: On the well-coveredness of Cartesian products of graphs. Discrete Math. 309(1), 238\u2013246 (2009)","journal-title":"Discrete Math."},{"key":"1123_CR9","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1006\/jctb.1993.1005","volume":"57","author":"A. Finbow","year":"1993","unstructured":"Finbow A., Hartnell B., Nowakowski R.: A characterization of well-covered graphs of girth 5 or greater. J. Combin. Theory B 57, 44\u201368 (1993)","journal-title":"J. Combin. Theory B"},{"key":"1123_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","volume":"180","author":"V. Giakoumakis","year":"1997","unstructured":"Giakoumakis V., Vanherpe J-M.: On extended P 4-reducible and extended P 4-sparse graphs. Theor. Comput. Sci. 180, 269\u2013286 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"1123_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.232","volume":"1","author":"V. Giakoumakis","year":"1997","unstructured":"Giakoumakis V., Roussel F., Thuillier H.: On P 4-tidy graphs. Discrete Math. Theor. Comput. Sci. 1, 17\u201341 (1997)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"1123_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer P.L., Simeone B.: The splittance of a graph. Combinatorica 1, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"1123_CR13","unstructured":"H\u00f3ang, C.: Doctoral Dissertation. McGill University, Montreal (1985)"},{"key":"1123_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/sapm198981189","volume":"81","author":"B. Jamison","year":"1989","unstructured":"Jamison B., Olariu S.: A new class of brittle graphs. Stud. Appl. Math. 81, 89\u201392 (1989)","journal-title":"Stud. Appl. Math."},{"key":"1123_CR15","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, a class of uniquely tree representable graphs. Stud. Appl. Math. 81, 79\u201387 (1989)","journal-title":"Stud. Appl. Math."},{"key":"1123_CR16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90085-B","volume":"34","author":"B. Jamison","year":"1991","unstructured":"Jamison B., Olariu S.: On a unique tree representation for P 4-extendible graphs. Discrete Appl. Math. 34, 151\u2013164 (1991)","journal-title":"Discrete Appl. Math."},{"key":"1123_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"Jamison B., Olariu S.: A unique tree representation for P 4-sparse graphs. Discrete Appl. Math. 35, 115\u2013129 (1992)","journal-title":"Discrete Appl. Math."},{"key":"1123_CR18","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":"1123_CR19","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."},{"issue":"2","key":"1123_CR20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<113::AID-JGT1>3.0.CO;2-U","volume":"21","author":"B. Prisner","year":"1996","unstructured":"Prisner B., Topp J., Vestergaard P.D.: Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory 21(2), 113\u2013119 (1996)","journal-title":"J. Graph Theory"},{"key":"1123_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0021-9800(70)80011-4","volume":"8","author":"M.D. Plummer","year":"1970","unstructured":"Plummer M.D.: Some covering concepts in graphs. J. Combin. Theory 8, 91\u201398 (1970)","journal-title":"J. Combin. Theory"},{"key":"1123_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1080\/16073606.1993.9631737","volume":"16","author":"M.D. Plummer","year":"1993","unstructured":"Plummer M.D.: Well covered graphs: a survey. Quaestiones Math. 16, 253\u2013287 (1993)","journal-title":"Quaestiones Math."},{"key":"1123_CR23","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1016\/j.dam.2005.05.041","volume":"154","author":"B. Randerath","year":"2006","unstructured":"Randerath B., Vestergaard P.D.: Well covered graphs and factors. Discrete Appl. Math. 154, 1416\u20131428 (2006)","journal-title":"Discrete Appl. Math."},{"key":"1123_CR24","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1002\/net.3230220304","volume":"22","author":"R.S. Sankaranarayana","year":"1992","unstructured":"Sankaranarayana R.S., Stewart L.K.: Complexity results for well-covered graphs. Networks 22, 247\u2013262 (1992)","journal-title":"Networks"},{"key":"1123_CR25","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1006\/jctb.1996.1742","volume":"69","author":"D. Tankus","year":"1997","unstructured":"Tankus D., Tarsi M.: The structure of well covered graphs and the complexity of their recognition problems. J. Combin. Theory B 69, 230\u2013233 (1997)","journal-title":"J. Combin. Theory B"},{"key":"1123_CR26","unstructured":"Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simple, linear-time modular decomposition. CoRR abs\/0710.3901 (2007)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1123-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1123-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1123-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,22]],"date-time":"2021-12-22T21:23:26Z","timestamp":1640208206000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1123-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,29]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1123"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1123-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,29]]}}}