{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:03:56Z","timestamp":1648760636423},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"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":6347,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1016\/0166-218x(95)00042-p","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"379-386","source":"Crossref","is-referenced-by-count":1,"title":["A note on perfectly orderable graphs"],"prefix":"10.1016","volume":"65","author":[{"given":"Chinh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00042-P_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","article-title":"Characterizations of totally balanced matrices","volume":"5","author":"Anstee","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(95)00042-P_BIB2","article-title":"A super-balanced hypergraph has a nest point","author":"Brouwer","year":"1980"},{"key":"10.1016\/0166-218X(95)00042-P_BIB3","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"key":"10.1016\/0166-218X(95)00042-P_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(93)90221-9","article-title":"Which claw-free graphs are perfectly orderable?","author":"Chv\u00e1tal","year":"1990"},{"key":"10.1016\/0166-218X(95)00042-P_BIB5","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\/0166-218X(95)00042-P_BIB6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0166-218X(95)00042-P_BIB7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterization of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00042-P_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(95)00042-P_BIB9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(92)90348-J","article-title":"A charming class of perfectly orderable graphs","volume":"102","author":"Ho\u00e0ng","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00042-P_BIB10","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(91)90373-A","article-title":"New properties of perfectly orderable graphs and strongly perfect graphs","volume":"98","author":"Ho\u00e0ng","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00042-P_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0012-365X(89)90200-8","article-title":"A note on perfect order","volume":"74","author":"Ho\u00e0ng","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00042-P_BIB12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0606070","article-title":"Totally balanced and greedy matrices","volume":"6","author":"Hoffman","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(95)00042-P_BIB13","article-title":"\u0393-free matrices","author":"Lubiw","year":"1982"},{"key":"10.1016\/0166-218X(95)00042-P_BIB14","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","article-title":"Doubly lexical orderings of matrices","volume":"16","author":"Lubiw","year":"1987","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0166-218X(95)00042-P_BIB15","article-title":"Structural aspects of perfect graphs","author":"Maffray","year":"1989"},{"key":"10.1016\/0166-218X(95)00042-P_BIB16","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","article-title":"On the complexity of recognizing perfectly orderable graphs","volume":"80","author":"Middendorf","year":"1990","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500042P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500042P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T12:22:40Z","timestamp":1555590160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500042P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["0166218X9500042P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00042-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}