乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:55:02Z","timestamp":1720054502392},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00177-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:55Z","timestamp":1027608955000},"page":"277-300","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["On semi-P4-sparse graphs"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Jean-Luc","family":"Fouquet","sequence":"first","affiliation":[]},{"given":"Vassilis","family":"Giakoumakis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00177-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB2","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtlich bzw, ungerade Kreise starr sind (Zusammenfassung)","author":"Berge","year":"1961","journal-title":"Wiss. Z. Martin Luther Univ. Halle Wittenberg, Math. Nat. Reihe"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB3","series-title":"Comm. 13e Assembl\u00e9e g\u00e9n\u00e9rale de l'URSI","article-title":"Sur une conjecture relative au probl\u00e8me des codes optimaux","author":"Berge","year":"1962"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/jgt.3190020104","article-title":"Graphs with unique maximal clumpings","volume":"2","author":"Blass","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB5","series-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB7","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190110405","article-title":"Four classes of perfectly orderable graphs","volume":"11","author":"Chv\u00e1tal","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB8","first-page":"68","article-title":"A New Linear Algorithm for Modular Decomposition","volume":"Vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","article-title":"Clustering and domination in perfect graphs","volume":"9","author":"Corneil","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement Reducible Graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB11","series-title":"Proc. 15th Southeastern Conference on Combinatorics","article-title":"Cographs: recognition, applications and algorithms","author":"Corneil","year":"1984"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB12","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","article-title":"On graphs without P5 and P5","volume":"146","author":"Fouquet","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbar graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB15","series-title":"Extended Abstract for the 4th Twente Workshop on Graphs and Combinatorial Optimization","article-title":"On extended P4-sparse graphs","author":"Giakoumakis","year":"1995"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02253207","article-title":"The complexity of comparability graph recognition and coloring","volume":"18","author":"Golumbic","year":"1977","journal-title":"Computing"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB17","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB18","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB19","series-title":"Topics on Perfect graphs","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"Vol. 88","author":"Gr\u00f6tschel","year":"1984"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB20","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","article-title":"Weakly triangulated graphs","volume":"39","author":"Hayward","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB21","first-page":"77","article-title":"On the dimension of partially ordered sets","volume":"1","author":"Hiragushi","year":"1951","journal-title":"Sci. Rep. Kanazawa Univ."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB22","author":"Ho\u00e1ng","year":"1985","journal-title":"Doctoral Dissertation"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB23","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A unique tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB24","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"A linear-time recognition algorithm for P4-sparse graphs","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB25","first-page":"1","article-title":"A linear-time recognition algorithm for P4-reducible graphs","volume":"Vol. 405","author":"Jamison","year":"1989"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB26","series-title":"On cliques and kernels","author":"Lerchs","year":"1971"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB27","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and intervall graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB28","series-title":"Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs","author":"McConnel","year":"1993"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB29","first-page":"257","article-title":"Substitution decomposition and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","article-title":"Incremental modular decomposition","volume":"36","author":"Muller","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB31","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0020-0190(90)90143-L","article-title":"On the closure of triangle-free graphs under substitution","volume":"34","author":"Olariu","year":"1990","journal-title":"Incom. Processing Lett."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB32","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","article-title":"Graph derivates","volume":"76","author":"Sabidussi","year":"1961","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(96)00177-X_BIB33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0095-8956(74)90063-X","article-title":"On a property of the class of n-colorable graphs","volume":"16","author":"Seinsche","year":"1974","journal-title":"JCT"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB34","first-page":"246","article-title":"On Comitties","author":"Sharpley","year":"1967"},{"key":"10.1016\/S0012-365X(96)00177-X_BIB35","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","article-title":"P4-trees and substitution decomposition","volume":"39","author":"Spinrad","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600177X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600177X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:42Z","timestamp":1556396742000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600177X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":35,"alternative-id":["S0012365X9600177X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00177-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}