{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:50Z","timestamp":1753889810061,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph Theory","license":[{"start":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T00:00:00Z","timestamp":1528070400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T00:00:00Z","timestamp":1528070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"},{"start":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T00:00:00Z","timestamp":1528070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>In this paper, we characterize the sets $\\mathcal{H}$ of connected graphs such that there exists a constant $c=c(\\mathcal{H})$ satisfying $\\gamma (G)\\leq c$ for every connected $\\mathcal{H}$-free graph $G$, where $\\gamma (G)$ is the domination number of $G$.<\/jats:p><jats:p>Comment: 6 pages, 1 figure<\/jats:p>","DOI":"10.23638\/dmtcs-20-1-19","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:50:32Z","timestamp":1743699032000},"source":"Crossref","is-referenced-by-count":0,"title":["Forbidden subgraphs for constant domination number"],"prefix":"10.23638","volume":"Vol. 20 no. 1","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2018,6,4]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1803.03913v3","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1803.03913v3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T16:50:32Z","timestamp":1743699032000},"score":1,"resource":{"primary":{"URL":"http:\/\/dmtcs.episciences.org\/4364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,4]]},"references-count":0,"journal-issue":{"issue":"Graph Theory","published-online":{"date-parts":[[2018,6,4]]}},"URL":"https:\/\/doi.org\/10.23638\/dmtcs-20-1-19","relation":{"has-preprint":[{"id-type":"arxiv","id":"1803.03913v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1803.03913v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1803.03913","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1803.03913","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2018,6,4]]},"article-number":"4364"}}