{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:56:25Z","timestamp":1720641385107},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"CAPES","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1016\/j.endm.2017.10.045","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T11:46:59Z","timestamp":1509018419000},"page":"261-266","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The lexicographic product of some chordal graphs and of cographs preserves b-continuity"],"prefix":"10.1016","volume":"62","author":[{"given":"Cl\u00e1udia","family":"Linhares Sales","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Sampaio","sequence":"additional","affiliation":[]},{"given":"Ana","family":"Silva","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2017.10.045_br0010","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.dam.2011.10.022","article-title":"b-coloring of Kneser graphs","volume":"160","author":"Balakrishnan","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.endm.2017.10.045_br0020","series-title":"Complexity of determining the b-continuity property of graphs","author":"Barth","year":"2003"},{"issue":"13","key":"10.1016\/j.endm.2017.10.045_br0030","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1016\/j.dam.2007.04.011","article-title":"On the b-continuity property of graphs","volume":"155","author":"Barth","year":"2007","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2017.10.045_br0040","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.endm.2017.10.045_br0050","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/s00373-008-0829-1","article-title":"On the b-coloring of cographs and P4-sparse graphs","volume":"25","author":"Bonomo","year":"2009","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.endm.2017.10.045_br0060","series-title":"Graph Classes: A Survey","author":"Brandstadt","year":"1999"},{"key":"10.1016\/j.endm.2017.10.045_br0070","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2017.10.045_br0080","doi-asserted-by":"crossref","first-page":"2072","DOI":"10.1016\/j.disc.2015.04.026","article-title":"The b-chromatic index of graphs","volume":"338","author":"Campos","year":"2015","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2017.10.045_br0090","first-page":"151","article-title":"About the b-continuity of graphs","volume":"vol. 17","author":"Faik","year":"2004"},{"key":"10.1016\/j.endm.2017.10.045_br0100","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"Journal of Combinatorial Theory B"},{"issue":"1","key":"10.1016\/j.endm.2017.10.045_br0110","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01917434","article-title":"s-functions of graphs","volume":"8","author":"Halin","year":"1976","journal-title":"Journal of Geometry"},{"issue":"18","key":"10.1016\/j.endm.2017.10.045_br0120","doi-asserted-by":"crossref","first-page":"2709","DOI":"10.1016\/j.dam.2011.10.017","article-title":"b-coloring of tight graphs","volume":"160","author":"Havet","year":"2012","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20133","key":"10.1016\/j.endm.2017.10.045_br0130","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","article-title":"The b-chromatic number of a graph","volume":"91","author":"Irving","year":"1999","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"10.1016\/j.endm.2017.10.045_br0140","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1556\/SScMath.49.2012.2.1194","article-title":"On the b-chromatic number of some graph products","volume":"49","author":"Jakovac","year":"2012","journal-title":"Studia Scientiarum Mathematicarum Hungarica"},{"issue":"13","key":"10.1016\/j.endm.2017.10.045_br0150","doi-asserted-by":"crossref","first-page":"4399","DOI":"10.1016\/j.disc.2009.01.017","article-title":"On b-coloring of the Kneser graphs","volume":"309","author":"Javadi","year":"2009","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2017.10.045_br0160","series-title":"b-continuity","author":"K\u00e1ra","year":"2004"},{"key":"10.1016\/j.endm.2017.10.045_br0170","series-title":"Graph-Theoretic Concepts in Computer Science","article-title":"On the b-chromatic number of graphs","author":"Kratochv\u00edl","year":"2002"},{"key":"10.1016\/j.endm.2017.10.045_br0180","series-title":"LAGOS'15","article-title":"b-continuity and the lexicographic product of graphs","author":"Linhares Sales","year":"2015"},{"key":"10.1016\/j.endm.2017.10.045_br0190","first-page":"143","article-title":"On b-continuity of Kneser graphs of type kg(2k + 1, k)","volume":"CXIX","author":"Shaebani","year":"2015","journal-title":"Ars Combinatoria"},{"key":"10.1016\/j.endm.2017.10.045_br0200","article-title":"The b-continuity of graphs with large girth","author":"Silva","year":"2017","journal-title":"Graphs and Combinatorics"},{"key":"10.1016\/j.endm.2017.10.045_br0210","author":"Silva"},{"issue":"1","key":"10.1016\/j.endm.2017.10.045_br0220","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2010.10.002","article-title":"On the b-coloring of P4-tidy graphs","volume":"159","author":"Velasquez","year":"2011","journal-title":"Discrete Applied Mathematics"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065317302846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T21:17:13Z","timestamp":1538687833000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065317302846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":22,"alternative-id":["S1571065317302846"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.045","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2017,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The lexicographic product of some chordal graphs and of cographs preserves b-continuity","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2017.10.045","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}