{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:18:26Z","timestamp":1758824306193},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":8233,"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":[[1991,1]]},"DOI":"10.1016\/0012-365x(91)90070-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"53-64","source":"Crossref","is-referenced-by-count":11,"title":["Some corollaries of a theorem of Whitney on the chromatic polynomial"],"prefix":"10.1016","volume":"87","author":[{"given":"Felix","family":"Lazebnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(91)90070-I_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0196-6774(85)90044-6","article-title":"A theoretical analysis of backtracking in the graph coloring problem","volume":"6","author":"Bender","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(91)90070-I_BIB2","doi-asserted-by":"crossref","first-page":"42","DOI":"10.2307\/1967597","article-title":"A determinant formula for the number of ways of coloring a map","volume":"14","author":"Birkhoff","year":"1912","journal-title":"Ann. Math."},{"key":"10.1016\/0012-365X(91)90070-I_BIB3","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","year":"1978"},{"issue":"1","key":"10.1016\/0012-365X(91)90070-I_BIB4","article-title":"On the number of triangles contained in certain graphs","volume":"7","author":"Erdős","year":"1964","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(91)90070-I_BIB5","first-page":"459","article-title":"On the number of complete subgraphs contained in certain graphs","volume":"7","author":"Erdős","year":"1962","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/0012-365X(91)90070-I_BIB6","first-page":"167","article-title":"Uber die obere Schranke des absoluten Betrages der Wurzeln einer algebraischen Gleichung","volume":"10","author":"Fujiwara","year":"1916","journal-title":"Tohoku Math. J."},{"key":"10.1016\/0012-365X(91)90070-I_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"issue":"2","key":"10.1016\/0012-365X(91)90070-I_BIB8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190130207","article-title":"On the greatest number of 2 and 3 colorings of a (v, e)-graph","volume":"13","author":"Lazebnik","year":"1989","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/0012-365X(91)90070-I_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/jgt.3190140104","article-title":"New upper bounds for the greatest number of proper colorings of a (v, e)-graph","volume":"14","author":"Lazebnik","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(91)90070-I_BIB10","series-title":"Ph.D. Thesis","article-title":"Some extremal problems for graphs with fixed numbers of vertices and edges","author":"Lazebnik","year":"1987"},{"key":"10.1016\/0012-365X(91)90070-I_BIB11","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0012-365X(91)90070-I_BIB12","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0095-8956(72)90003-2","article-title":"Coefficients of chromatic polynomials","volume":"13","author":"Meredith","year":"1972","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(91)90070-I_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4153\/CJM-1963-004-7","article-title":"Triangles in an ordinary graph","volume":"15","author":"Nordhaus","year":"1963","journal-title":"Canad. J. Math."},{"issue":"7","key":"10.1016\/0012-365X(91)90070-I_BIB14","doi-asserted-by":"crossref","first-page":"797","DOI":"10.2307\/2318170","article-title":"The chromatic polynomial of a complete bipartite graph","volume":"80","author":"Swenson","year":"1973","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(91)90070-I_BIB15","first-page":"1301","article-title":"Le nombre maximal de colorations d'un graphe","volume":"272","author":"Tomescu","year":"1971","journal-title":"C.R. Acad. Sc. Paris"},{"key":"10.1016\/0012-365X(91)90070-I_BIB16","series-title":"Combinatorial Programming: Methods and Applications","first-page":"327","article-title":"Problemes Extremaux Concernant le nombre des colorations des summets d'un graphe fini","author":"Tomescu","year":"1975"},{"key":"10.1016\/0012-365X(91)90070-I_BIB17","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Mat. Fiz. Lapok"},{"key":"10.1016\/0012-365X(91)90070-I_BIB18","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1090\/S0002-9904-1932-05460-X","article-title":"A logical expansion in mathematics","volume":"38","author":"Whitney","year":"1932","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(91)90070-I_BIB19","series-title":"Mathematics for the Physical Sciences","author":"Wilf","year":"1978"},{"key":"10.1016\/0012-365X(91)90070-I_BIB20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(84)90013-9","article-title":"Backtrack: An O(1) expected time algorithm for the graph coloring problem","volume":"18","author":"Wilf","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0012-365X(91)90070-I_BIB21","doi-asserted-by":"crossref","first-page":"82","DOI":"10.4153\/CJM-1972-010-7","article-title":"Counting coloured graphs III","volume":"1","author":"Wright","year":"1972","journal-title":"Canad. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190070I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9190070I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:56:28Z","timestamp":1555134988000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9190070I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0012365X9190070I"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(91)90070-i","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}