{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:16:35Z","timestamp":1753884995395,"version":"3.41.2"},"reference-count":8,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p> A connected graph [Formula: see text] is double-critical if the chromatic number of [Formula: see text] is two less than that of [Formula: see text] whenever [Formula: see text] and [Formula: see text] are two adjacent vertices of [Formula: see text]. The double-critical graph conjecture states that the complete graphs are the only double-critical graphs. We give a proof of this conjecture for any double-critical graph that contains at least one universal vertex. Using this result we prove the conjecture for all double-critical graphs. <\/jats:p>","DOI":"10.1142\/s1793830922501336","type":"journal-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T01:41:38Z","timestamp":1660268498000},"source":"Crossref","is-referenced-by-count":0,"title":["On the double-critical graph conjecture"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5402-476X","authenticated-orcid":false,"given":"R.","family":"Dharmarajan","sequence":"first","affiliation":[{"name":"Niels Abel Foundation, 7\/538, \u2018Vidhyashree\u2019, Karekkaattu Parambu, Ambikapuram P. O., Palakkad, Kerala 678011, India"}]},{"given":"D.","family":"Ramachandran","sequence":"additional","affiliation":[{"name":"Niels Abel Foundation, 7\/538, \u2018Vidhyashree\u2019, Karekkaattu Parambu, Ambikapuram P. O., Palakkad, Kerala 678011, India"}]}],"member":"219","published-online":{"date-parts":[[2022,8,31]]},"reference":[{"issue":"1","key":"S1793830922501336BIB001","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1002\/jgt.22203","volume":"88","author":"Albar B.","year":"2018","journal-title":"J. Graph Theory"},{"key":"S1793830922501336BIB002","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-79711-3","volume-title":"Combinatorics and Graph Theory","author":"Harris J. M.","year":"2008"},{"key":"S1793830922501336BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/359","volume":"17","author":"Kawarabayashi K.","year":"2010","journal-title":"Electron. J. Combin."},{"key":"S1793830922501336BIB005","first-page":"50","volume":"46","author":"Mozhan N. N.","year":"1987","journal-title":"Metody Diskretn. Anal."},{"key":"S1793830922501336BIB006","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/567","volume":"18","author":"Pedersen A. S.","year":"2011","journal-title":"Electron. J. Combin."},{"key":"S1793830922501336BIB007","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/jgt.22216","volume":"88","author":"Rolek M.","year":"2018","journal-title":"J. Graph Theory"},{"key":"S1793830922501336BIB009","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(87)90242-1","volume":"64","author":"Stiebitz M.","year":"1987","journal-title":"Discrete Math."},{"volume-title":"Set Theory and Logic","year":"1979","author":"Stoll R. R.","key":"S1793830922501336BIB010"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T08:39:32Z","timestamp":1686213572000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501336"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,31]]},"references-count":8,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["10.1142\/S1793830922501336"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501336","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,8,31]]},"article-number":"2250133"}}