{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,19]],"date-time":"2022-06-19T20:49:39Z","timestamp":1655671779367},"reference-count":42,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":5495,"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":[[1998,7]]},"DOI":"10.1016\/s0012-365x(97)00277-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"43-68","source":"Crossref","is-referenced-by-count":9,"title":["Chromatic polynomials and order ideals of monomials"],"prefix":"10.1016","volume":"189","author":[{"given":"Jason I.","family":"Brown","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00277-X_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0024-3795(79)90113-7","article-title":"On the Enestr\u00f6m-Kakeya theorem and its sharpness","volume":"28","author":"Anderson","year":"1979","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0195-6698(82)80014-0","article-title":"Cohen-Macaulay connectivity and geometric lattices","volume":"3","author":"Baclawski","year":"1982","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB3","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0603016","article-title":"Bounds on the reliability polynomial for shellable independence systems","volume":"3","author":"Ball","year":"1982","journal-title":"SIAM J. Algebra Discrete Methods"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0021-9800(69)80091-8","article-title":"The golden root of a chromatic polynomial","volume":"6","author":"Berman","year":"1969","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB5","series-title":"Algebraic Graph Theory","author":"Biggs","year":"1993"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB6","series-title":"Mathematical Programming: the State of the Art","first-page":"57","article-title":"Polyhedral Theory and Commutative Algebra","author":"Billera","year":"1983"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB7","series-title":"Matroid Applications","first-page":"226","article-title":"Homology and Shellability","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4153\/CJM-1994-002-3","article-title":"Location of zeros of chromatic and related polynomials of graphs","volume":"46","author":"Brenti","year":"1994","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1971-0288039-7","article-title":"A combinatorial model for series-parallel networks","volume":"154","author":"Brylawski","year":"1971","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB10","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1090\/S0002-9947-1977-0468931-6","article-title":"The broken circuit complex","volume":"234","author":"Brylawski","year":"1977","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0195-6698(81)80001-7","article-title":"The broken circuit complex: its structure and factorizations","volume":"2","author":"Brylawski","year":"1981","journal-title":"Eur. J. Combin."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0405047","article-title":"Roots of the reliability polynomial","volume":"5","author":"Brown","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1022484229443","article-title":"Non-Stanley bounds for network reliability","volume":"5","author":"Brown","year":"1996","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1137\/S0895480194270780","article-title":"Cohen-Macaulay rings in network reliability","volume":"9","author":"Brown","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB15","first-page":"19","article-title":"A theoretical basis for the reduction of polynomials to canonical forms","volume":"10","author":"Buchberger","year":"1976","journal-title":"ACM SIGSAM Bull."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB16","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB17","article-title":"Some open problems on reliability polynomials","author":"Colbourn","year":"1993","journal-title":"DIAMCS Techincal Report 93-28"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB18","series-title":"Advanced Combinatorics","author":"Comtet","year":"1974"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB19","series-title":"Ideals, Varieties, and Algorithms","author":"Cox","year":"1992"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB20","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0021-9800(67)80051-6","article-title":"A higher invariant for matroids","volume":"2","author":"Crapo","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB21","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(80)90003-5","article-title":"Chromatic roots \u2014 some observations and conjectures","volume":"29","author":"Farrell","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB22","first-page":"57","article-title":"The chromatic polynomial revisited","volume":"55","author":"Frank","year":"1986","journal-title":"Cong. Numer."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB23","series-title":"Algorithms for Computer Algebra","author":"Geddes","year":"1992"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB24","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB25","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0097-3165(89)90025-3","article-title":"What can be said about pure O-sequences?","volume":"50","author":"Hibi","year":"1989","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB26","doi-asserted-by":"crossref","first-page":"253","DOI":"10.2140\/pjm.1992.154.253","article-title":"Face number inequalities for matroid complexes and Cohen-Macaulay types of Stanley-Reisner rings of distributive lattices","volume":"154","author":"Hibi","year":"1992","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB27","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0095-8956(74)90071-9","article-title":"Chromatic polynomials and logarithmic concavity","volume":"16","author":"Hoggar","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB28","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1017\/S0963548300000705","article-title":"A zero-free interval for chromatic polynomials of graphs","volume":"2","author":"Jackson","year":"1993","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB29","article-title":"Computing chromatic polynomials for special families of graphs","author":"Leorinc","year":"1979"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB30","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0095-8956(81)80010-X","article-title":"Chromatic polynomials for regular graphs and modified wheels","volume":"31","author":"Leorinc","year":"1981","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB31","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1112\/plms\/s2-26.1.531","article-title":"Some properties of enumeration in the theory of modular systems","volume":"26","author":"Macaulay","year":"1927","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB32","series-title":"Combinatorial Algorithms","author":"Nijenhuis","year":"1978"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB33","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1002\/sapm1982663267","article-title":"On Crapo's beta invariants for matroids","volume":"66","author":"Oxley","year":"1982","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB34","series-title":"Graph Theory, Combinatorics and Applications","first-page":"1009","article-title":"Chromatic roots of families of graphs","author":"Read","year":"1991"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB35","series-title":"Selected Topics in Graph Theory 3","first-page":"15","article-title":"Chromatic polynomials","author":"Read","year":"1988"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB36","series-title":"Higher Combinatorics","first-page":"51","article-title":"Cohen-Macaulay complexes","author":"Stanley","year":"1977"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB37","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/S0002-9947-1979-0526314-6","article-title":"Balanced Cohen-Macaulay complexes","volume":"249","author":"Stanley","year":"1979","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB38","article-title":"Graphen and Polynome","author":"Thier","year":"1983"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB39","series-title":"Graphs: Theory and Algorithms","author":"Thulasiraman","year":"1992"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB40","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1017\/S0963548300000195","article-title":"The computational complexity of the Tutte plane: the bipartite case","volume":"2","author":"Vertigan","year":"1992","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0012-365X(97)00277-X_BIB41","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/S0012-365X(97)00277-X_BIB42","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(92)90613-K","article-title":"An inequality for chromatic polynomials","volume":"101","author":"Woodall","year":"1992","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700277X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9700277X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:53:39Z","timestamp":1556132019000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9700277X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0012365X9700277X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00277-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}