{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:23Z","timestamp":1720640783001},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s1571-0653(04)00093-9","type":"journal-article","created":{"date-parts":[[2004,10,15]],"date-time":"2004-10-15T15:21:27Z","timestamp":1097853687000},"page":"485-490","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the existence of uniquely partitionable graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"Peter","family":"Mih\u00f3k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(97)00022-8","article-title":"The existence of uniquely \u2013G colourable graphs","volume":"179","author":"Achlioptas","year":"1998","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/16073606.1990.9631616","article-title":"A construction of uniquely C4-free colourable graphs","volume":"13","author":"Benad\u00e9","year":"1990","journal-title":"Questiones Mathematicae"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(95)00301-C","article-title":"Uniquely (m, k)\u03c4 - colourable graphs and k \u2013 \u03c4 -saturated graphs","volume":"162","author":"Benad\u00e9","year":"1996","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB4","unstructured":"A. Berger, Reducible properties have infinitely many minimal forbidden subgraphs. Discussiones Mathematicae - Graph Theory, (submitted)."},{"issue":"2","key":"10.1016\/S1571-0653(04)00093-9_NEWBIB5","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1112\/jlms\/s2-16.3.403","article-title":"Uniquely partitionable graphs","volume":"16","author":"Bollob\u00e1s","year":"1977","journal-title":"J. London Math. Soc"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB6","first-page":"70","article-title":"Hereditary and monotone properties of graphs","volume":"vol. 14","author":"Bollob\u00e1s","year":"1997"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.7151\/dmgt.1037","article-title":"Survey of hereditary properties of graphs","volume":"17","author":"Borowiecki","year":"1997","journal-title":"Discussiones Mathematicae - Graph Theory"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1002\/jgt.3190110113","article-title":"On generalized graph colourings","volume":"11","author":"Brown","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB9","first-page":"79","article-title":"Divisibility in additive hereditary graph properties and uniquely partitionable graphs","volume":"18","author":"Broere","year":"1999","journal-title":"Tatra Mountains Math. Publications"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.7151\/dmgt.1043","article-title":"Uniquely partitionable graphs","volume":"17","author":"Bucko","year":"1997","journal-title":"Discussiones Mathematicae - Graph Theory"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB11","first-page":"45","article-title":"A survey of (m, k)-colourings","volume":"vol. 55","author":"Frick","year":"1993"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB12","series-title":"Handbook of combinatorics","author":"Graham","year":"1995"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/S0021-9800(69)80086-4","article-title":"Uniquely colourable graphs","volume":"6","author":"Harary","year":"1969","journal-title":"J. Comb. Theory"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB14","series-title":"Graph colouring problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB15","series-title":"Graphs, hypergraphs and matroids","first-page":"49","article-title":"Additive hereditary properties and uniquely partitionable graphs","author":"Mih\u00f3k","year":"1985"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1090\/dimacs\/049\/15","article-title":"Reducible properties and uniquely partitionable graphs","volume":"Volume 49","author":"Mih\u00f3k","year":"1999","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB17","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1002\/(SICI)1097-0118(200001)33:1<44::AID-JGT5>3.0.CO;2-O","article-title":"Additive and Hereditary Properties of Graphs are Uniquely Factorizable into Irreducible Factors","volume":"33","author":"Mih\u00f3k","year":"2000","journal-title":"Journal of Graph Theory"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB18","unstructured":"P. Mih\u00f3k Unique Factorization Theorems, Discussiones Mathematicae - Graph Theory, (submitted)."},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02771516","article-title":"Uniquely k-arborable graphs","volume":"10","author":"Mitchem","year":"1971","journal-title":"Israel Journal of Mathematics"},{"key":"10.1016\/S1571-0653(04)00093-9_NEWBIB20","first-page":"1351","article-title":"On graphs uniquely partitionable into n-degenerate subgraphs in: Infinite and Finite Sets, Colloquia Math","volume":"10","author":"Simoes-Pereira","year":"1975","journal-title":"Soc. J. B\u00f3lyai"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000939?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304000939?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T02:54:31Z","timestamp":1549162471000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304000939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":20,"alternative-id":["S1571065304000939"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00093-9","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}