{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:02Z","timestamp":1759063442441,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The distinguishing chromatic number $\\chi_D(G)$ of a graph $G$ is the minimum number of colours required to properly colour the vertices of $G$ so that the only automorphism of $G$ that preserves colours is the identity. For a graph $G$ of order $n$, it is clear that $1\\leq\\chi_D(G)\\leq n$, and it has been shown that $\\chi_D(G)=n$ if and only if $G$ is a complete multipartite graph. This paper characterizes the graphs $G$ of order $n$ satisfying $\\chi_D(G)=n-1$ or $\\chi_D(G)=n-2$.<\/jats:p>","DOI":"10.37236\/2407","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T22:00:16Z","timestamp":1578693616000},"source":"Crossref","is-referenced-by-count":3,"title":["Graphs with Large Distinguishing Chromatic Number"],"prefix":"10.37236","volume":"20","author":[{"given":"Michael","family":"Cavers","sequence":"first","affiliation":[]},{"given":"Karen","family":"Seyffarth","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,1,29]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p19\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p19\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T06:27:38Z","timestamp":1579242458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,29]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2407","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,1,29]]},"article-number":"P19"}}