{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T20:18:12Z","timestamp":1772050692574,"version":"3.50.1"},"reference-count":14,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T00:00:00Z","timestamp":1628553600000},"content-version":"vor","delay-in-days":40,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,7,28]]},"published-print":{"date-parts":[[2021,7]]},"abstract":"A partition \u03c0<\/jats:italic> = {V<\/jats:italic>1<\/jats:sub>, V<\/jats:italic>2<\/jats:sub>,\u2026,V<\/jats:italic>k<\/jats:italic><\/jats:sub>} of the vertex set V<\/jats:italic> of a graph G<\/jats:italic> into k<\/jats:italic> color classes V<\/jats:italic>i<\/jats:italic><\/jats:sub>, with 1 \u2264 i<\/jats:italic> \u2264 k<\/jats:italic> is called a quorum coloring if for every vertex v<\/jats:italic> \u2208 V<\/jats:italic>, at least half of the vertices in the closed neighborhood N<\/jats:italic> [v<\/jats:italic>] of v<\/jats:italic> have the same color as v<\/jats:italic>. The maximum cardinality of a quorum coloring of G<\/jats:italic> is called the quorum coloring number of G<\/jats:italic> and is denoted \u03c8<\/jats:italic>q<\/jats:italic><\/jats:sub> (G<\/jats:italic>).<\/jats:italic> In this paper, we give answers to four open problems stated in 2013 by Hedetniemi, Hedetniemi, Laskar and Mulder. In particular, we show that there is no good characterization of the graphs G<\/jats:italic> with \u03c8<\/jats:italic>q<\/jats:italic><\/jats:sub> (G<\/jats:italic>) nor for those with \u03c8<\/jats:italic>q<\/jats:italic><\/jats:sub> (G<\/jats:italic>) > 1 unless \ud835\udcab \u2260 \ud835\udca9\ud835\udcab \u2229 co<\/jats:italic> \u2013 \ud835\udca9\ud835\udcab. We also construct several new infinite families of such graphs, one of which the diameter diam<\/jats:italic> (G<\/jats:italic>) of G<\/jats:italic> is not bounded.<\/jats:p>","DOI":"10.1051\/ro\/2021116","type":"journal-article","created":{"date-parts":[[2021,7,29]],"date-time":"2021-07-29T19:06:49Z","timestamp":1627585609000},"page":"2385-2394","source":"Crossref","is-referenced-by-count":3,"title":["Solutions to four open problems on quorum colorings of graphs"],"prefix":"10.1051","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1175-5137","authenticated-orcid":false,"given":"Rafik","family":"Sahbi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,8,10]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.ejor.2009.10.019","volume":"206","author":"Bazgan","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"R3","first-page":"519","volume":"103","author":"Eroh","year":"2012","journal-title":"Ars Comb."},{"key":"R4","first-page":"37","volume":"38","author":"Fricke","year":"2003","journal-title":"Bull. ICA"},{"key":"R5","first-page":"51","volume":"4","author":"Haynes","year":"2007","journal-title":"AKCE Int. J. Graphs Combin."},{"key":"R6","first-page":"157","volume":"48","author":"Hedetniemi","year":"2004","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"R7","first-page":"97","volume":"10","author":"Hedetniemi","year":"2013","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"R8","doi-asserted-by":"crossref","first-page":"599","DOI":"10.7155\/jgaa.00307","volume":"17","author":"Olsen","year":"2013","journal-title":"J. Graph Algorithms Appl."},{"key":"R9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.akcej.2017.05.002","volume":"15","author":"Ouazine","year":"2018","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"R10","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1016\/j.akcej.2019.12.010","volume":"17","author":"Sahbi","year":"2020","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"R11","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.dam.2018.03.060","volume":"247","author":"Sahbi","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"R12","unstructured":"Shafique K.H., Partitioning a graph in alliances and its application to data clustering. Ph.D. thesis in Computer Science, University of Central Florida (2004)."},{"key":"R13","first-page":"183","volume":"154","author":"Shafique","year":"2002","journal-title":"Congr. Numer."},{"key":"R14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1002\/(SICI)1097-0118(199611)23:3<321::AID-JGT12>3.0.CO;2-H","volume":"23","author":"Stiebitz","year":"1996","journal-title":"J. Graph Theory"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021116\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T08:18:07Z","timestamp":1628583487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":14,"journal-issue":{"issue":"4"},"alternative-id":["ro210138"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021116","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}