{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:54:12Z","timestamp":1648652052112},"reference-count":29,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":7290,"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":[[1993,8]]},"DOI":"10.1016\/0012-365x(93)90118-d","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"79-96","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite bithreshold graphs"],"prefix":"10.1016","volume":"119","author":[{"given":"Peter L.","family":"Hammer","sequence":"first","affiliation":[]},{"given":"N.V.R.","family":"Mahadev","sequence":"additional","affiliation":[]},{"given":"Uri N.","family":"Peled","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90118-D_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0012-365X(93)90118-D_BIB2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01788543","article-title":"Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials","author":"Beissinger","year":"1987","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(93)90118-D_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/jgt.3190090207","article-title":"Threshold characterization of graphs with Dilworth number two","volume":"9","author":"Benzaken","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(93)90118-D_BIB4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","article-title":"Aggregation of inequalities in integer programming","volume":"1","author":"Chv\u00e1tal","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90118-D_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\/0012-365X(93)90118-D_BIB6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(82)90166-2","article-title":"Ferrers digraphs and threshold graphs","volume":"38","author":"Cogis","year":"1982","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB7","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/0605055","article-title":"Threshold dimension of graphs","volume":"5","author":"Cozzens","year":"1984","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(93)90118-D_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0022-2496(87)90014-9","article-title":"Multidimensional scaling and threshold graphs","volume":"31","author":"Cozzens","year":"1987","journal-title":"J. Math. Psych."},{"key":"10.1016\/0012-365X(93)90118-D_BIB9","article-title":"On a graph labelling problem","author":"Ecker","year":"1977","journal-title":"Gesellschraft f\u00fcr Mathematik und Datenverarbeitung MBH"},{"key":"10.1016\/0012-365X(93)90118-D_BIB10","doi-asserted-by":"crossref","first-page":"666","DOI":"10.4153\/CJM-1977-069-1","article-title":"Split graphs having Dilworth number two","volume":"29","author":"Foldes","year":"1977","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB11","first-page":"331","article-title":"Threshold graphs and synchronizing parallel processes","volume":"Vol. 18","author":"Golumbic","year":"1976","journal-title":"Colloqui Mathematica Societatis J\u00e1nos Bolyai, Combinatorics"},{"key":"10.1016\/0012-365X(93)90118-D_BIB12","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0012-365X(93)90118-D_BIB13","first-page":"125","article-title":"Threshold numbers and threshold completions","volume":"11","author":"Hammer","year":"1981","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","article-title":"Threshold sequences","volume":"21","author":"Hammer","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(93)90118-D_BIB15","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0606049","article-title":"Bithreshold graphs","volume":"6","author":"Hammer","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0012-365X(93)90118-D_BIB16","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/net.3230190103","article-title":"Some properties of 2-threshold graphs","volume":"19","author":"Hammer","year":"1989","journal-title":"Networks"},{"key":"10.1016\/0012-365X(93)90118-D_BIB17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(87)90050-3","article-title":"Hamiltonian threshold graphs","volume":"16","author":"Harary","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB18","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0206008","article-title":"A graph-theoretic characterization of the PV chunk class of synchronizing primitives","volume":"6","author":"Henderson","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90118-D_BIB19","first-page":"241","article-title":"Sufficient conditions for graphs to have threshold number 2","volume":"11","author":"Ibaraki","year":"1981","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB20","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(73)90037-3","article-title":"Extreme degree sequences of simple graphs","volume":"15","author":"Koren","year":"1973","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90118-D_BIB21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0166-218X(88)90048-0","article-title":"Strict 2-threshold graphs","volume":"21","author":"Mahadev","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB22","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/0012-365X(93)90118-D_BIB23","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\/0012-365X(93)90118-D_BIB24","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\/0012-365X(93)90118-D_BIB25","first-page":"99","article-title":"Threshold coverings and resource allocation","author":"Ordman","year":"1985","journal-title":"Proc. 16th Southeastern Conf. on Graph Theory, Combinatorics and Computing"},{"key":"10.1016\/0012-365X(93)90118-D_BIB26","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/S0167-5060(08)70749-0","article-title":"The minimal integral separator of a threshold graph","volume":"1","author":"Orlin","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90118-D_BIB27","first-page":"735","article-title":"Threshold graph enumeration and series-product identities","author":"Peled","year":"1980","journal-title":"Proc. 11th Southeastern Conf. on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0012-365X(93)90118-D_BIB28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","article-title":"The polytope of degree sequences","volume":"114\/115","author":"Peled","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0012-365X(93)90118-D_BIB29","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390118D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390118D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:55:19Z","timestamp":1555120519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390118D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["0012365X9390118D"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90118-d","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}