{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:40:05Z","timestamp":1770327605876,"version":"3.49.0"},"reference-count":26,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,6,27]]},"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p>A <jats:italic>b<\/jats:italic>-coloring of a graph <jats:italic>G<\/jats:italic> is a proper coloring of <jats:italic>G<\/jats:italic> with <jats:italic>k<\/jats:italic> colors such that each color class has a vertex that is adjacent to at least one vertex of every other color classes. The <jats:italic>b<\/jats:italic>-chromatic number is the largest integer <jats:italic>k<\/jats:italic> for which <jats:italic>G<\/jats:italic> has a <jats:italic>b<\/jats:italic>-coloring with <jats:italic>k<\/jats:italic> colors. In this paper, we present some results on <jats:italic>b<\/jats:italic>-coloring in complementary prism graphs.<\/jats:p>","DOI":"10.1051\/ro\/2018054","type":"journal-article","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T18:52:06Z","timestamp":1530298326000},"page":"1187-1195","source":"Crossref","is-referenced-by-count":4,"title":["Some results on the <i>b<\/i>-chromatic number in complementary prism graphs"],"prefix":"10.1051","volume":"53","author":[{"given":"Amel","family":"Bendali-Braham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noureddine","family":"Ikhlef-Eschouf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Blidia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"key":"R1","first-page":"218","volume":"68","author":"Alhashim","year":"2017","journal-title":"Australas. J. Combin."},{"key":"R2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.dam.2011.10.022","volume":"160","author":"Balakrishnan","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"R3","unstructured":"Berge C., Graphs. North Holland, Amsterdam\/New York (1985)."},{"key":"R4","doi-asserted-by":"crossref","first-page":"1787","DOI":"10.1016\/j.dam.2009.01.007","volume":"157","author":"Blidia","year":"2009","journal-title":"Discrete Appl. Math."},{"key":"R5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/j.endm.2009.11.046","volume":"35","author":"Campos","year":"2009","journal-title":"Electron. Notes Discrete Math."},{"key":"R6","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1080\/09720529.2005.10698054","volume":"8","author":"Effantin","year":"2005","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"R7","first-page":"45","volume":"6","author":"Effantin","year":"2003","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/09720529.2005.10698024","volume":"8","author":"Effantin","year":"2005","journal-title":"J. Discrete Math. Sci. Cryptogr."},{"key":"R9","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.dam.2009.09.023","volume":"158","author":"Hajiabolhassan","year":"2010","journal-title":"Discrete Appl. Math."},{"key":"R10","first-page":"21","volume":"51","author":"Haynes","year":"2007","journal-title":"Bull. Inst. Comb. Appl."},{"key":"R11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10878-007-9135-8","volume":"18","author":"Haynes","year":"2009","journal-title":"J. Comb. Optim."},{"key":"R12","first-page":"45","volume":"199","author":"Haynes","year":"2009","journal-title":"Congr. Numerantium"},{"key":"R13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"Ivring","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00373-010-0898-9","volume":"26","author":"Jakovac","year":"2010","journal-title":"Graphs Comb."},{"key":"R15","first-page":"156","volume":"49","author":"Jakovac","year":"2012","journal-title":"Studia Sci. Math. Hungar."},{"key":"R16","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.dam.2017.08.008","volume":"235","author":"Jakovac","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"R17","first-page":"31","volume":"14","author":"Janseana","year":"2016","journal-title":"Thai J. Math."},{"key":"R18","doi-asserted-by":"crossref","first-page":"4399","DOI":"10.1016\/j.disc.2009.01.017","volume":"309","author":"Javadi","year":"2009","journal-title":"Discrete Math."},{"key":"R19","first-page":"147","volume":"15","author":"Kohl","year":"2013","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R20","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-36379-3_27","volume":"2573","author":"Kratochvl","year":"2002","journal-title":"Lect. Notes Comput. Sci."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1016\/j.dam.2012.11.012","volume":"161","author":"Lin","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"R22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.endm.2009.11.035","volume":"35","author":"Linhares-Sales","year":"2009","journal-title":"Electron. Notes Discrete Math."},{"key":"R23","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.dam.2011.06.019","volume":"161","author":"Maffray","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"R24","doi-asserted-by":"crossref","first-page":"1796","DOI":"10.1016\/j.disc.2012.01.035","volume":"312","author":"Maffray","year":"2012","journal-title":"Discrete Math."},{"key":"R25","unstructured":"Manlove D.F., Minimaximal and maximinimal optimization problems: a partial order-based approach. Ph.D. thesis, technical report tr-1998-27 of the Computing Science Department of Glasgow University (1998)."},{"key":"R26","unstructured":"Russell H.D., Italian domination in complementary prisms. Electronic thesis and dissertations. Paper 3429 (2018)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018054\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T08:12:16Z","timestamp":1584691936000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,29]]},"references-count":26,"journal-issue":{"issue":"4"},"alternative-id":["ro180048"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018054","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,29]]}}}