{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T18:58:15Z","timestamp":1783450695185,"version":"3.55.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1007\/bf02122553","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T02:29:39Z","timestamp":1130552979000},"page":"63-74","source":"Crossref","is-referenced-by-count":62,"title":["On multiplicative graphs and the product conjecture"],"prefix":"10.1007","volume":"8","author":[{"given":"R.","family":"H\u00e4ggkvist","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Hell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D. J.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V.","family":"Neumann Lara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"BF02122553_CR1","first-page":"167","volume":"1","author":"S. Burr","year":"1976","unstructured":"S. Burr, P. Erd\u0151s andL. Lov\u00e1sz, On graphs of Ramsey type,ARS Comb.,1 (1976), 167\u2013190.","journal-title":"ARS Comb."},{"key":"BF02122553_CR2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/jgt.3190110402","volume":"11","author":"G. Bloom","year":"1987","unstructured":"G. Bloom andS. Burr, On unavoidable digraphs in orientations of graphs,J. Graph Theory 11 (1987), 453\u2013462.","journal-title":"J. Graph Theory"},{"key":"BF02122553_CR3","doi-asserted-by":"crossref","unstructured":"D.Duffus, B.Sands and R.Woodrow, On the chromatic number of the products of graphs,J. Graph Theory, to appear.","DOI":"10.1002\/jgt.3190090409"},{"key":"BF02122553_CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02579374","volume":"5","author":"M. El-Zahar","year":"1985","unstructured":"M. El-Zahar andN. Sauer, The chromatic number of the product of two four-chromatic graphs is four,Combinatorica,5 (1985), 121\u2013126.","journal-title":"Combinatorica"},{"key":"BF02122553_CR5","unstructured":"A. M. H.Gerards, Homomorphisms of graphs into odd cycles,preprint 1986."},{"key":"BF02122553_CR6","unstructured":"P. J.Giblin,Graphs, Surfaces and Homology, Chapman and Hall, 1977."},{"key":"BF02122553_CR7","unstructured":"R.H\u00e4ggkvist, P.Hell, D. J.Miller and V.Neumann-Lara, On multiplicative graphs and the product conjecture,Report No. 11, 1985,Matematiska Institutionen, Stockholms Universitet."},{"key":"BF02122553_CR8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF02579376","volume":"5","author":"A. Hajnal","year":"1985","unstructured":"A. Hajnal, The chromatic number of the product of two aleph-one chromatic graphs can be countable,Combinatorica,5 (1985), 137\u2013139.","journal-title":"Combinatorica"},{"key":"BF02122553_CR9","doi-asserted-by":"crossref","unstructured":"F.Harary,Graph Theory, Addison-Wesley, 1969.","DOI":"10.21236\/AD0705364"},{"key":"BF02122553_CR10","unstructured":"S.Hedetniemi, Homomorphisms of graphs and automata,University of Michigan Technical Report 03105-44-T, 1966."},{"key":"BF02122553_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BFb0066450","volume":"406","author":"P. Hell","year":"1974","unstructured":"P. Hell,Retracts in graphs, Springer-Verlag Lecture Notes in Mathematics406 (1974), 291\u2013301.","journal-title":"Springer-Verlag Lecture Notes in Mathematics"},{"key":"BF02122553_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0095-8956(74)90040-9","volume":"17","author":"P. Hell","year":"1984","unstructured":"P. Hell, Absolute retracts and the four color conjecture,J. Combin. Theory (B),17(1984), 5\u201310.","journal-title":"J. Combin. Theory (B)"},{"key":"BF02122553_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BF02485713","volume":"4","author":"P. Hell","year":"1974","unstructured":"P. Hell, On some strongly rigid families of graphs and the full embeddings they induce,Alg. Universalis. 4 (1974), 108\u2013126.","journal-title":"Alg. Universalis."},{"key":"BF02122553_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.4153\/CMB-1970-071-3","volume":"13","author":"P. Hell","year":"1970","unstructured":"P. Hell andJ. Ne\u0161et\u0159il, Graphs andk-societies,Canad. Math. Bull. 13 (1970), 375\u2013381","journal-title":"Canad. Math. Bull."},{"key":"BF02122553_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/mana.19790870107","volume":"87","author":"P. Hell","year":"1979","unstructured":"P. Hell andJ. Ne\u0161et\u0159il, Cohomomorphisms of graphs and hypergraphs,Math., Nachr. 87 (1979), 53\u201361.","journal-title":"Math., Nachr."},{"key":"BF02122553_CR16","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.4153\/CJM-1968-151-x","volume":"20","author":"D. J. Miller","year":"1968","unstructured":"D. J. Miller, The categorical product of graphs,Canada. J. Math.,20 (1968), 1511\u20131521.","journal-title":"Canada. J. Math."},{"key":"BF02122553_CR17","first-page":"187","volume":"22","author":"J. Ne\u0161et\u0159il","year":"1979","unstructured":"J. Ne\u0161et\u0159il andA. Pultr, On classes of relations and graphs determined by subobjects and factorobjects.Discrete Math. 22 (1979), 187\u2013300.","journal-title":"Discrete Math."},{"key":"BF02122553_CR18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190030404","volume":"3","author":"R. Nowakowski","year":"1981","unstructured":"R. Nowakowski andI. Rival, Fixed-edge theorem for graphs with loops.J. Graph Theory. 3 (1981), 339\u2013350.","journal-title":"J. Graph Theory."},{"key":"BF02122553_CR19","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0095-8956(81)80024-X","volume":"31","author":"S. Poljak","year":"1981","unstructured":"S. Poljak andV. R\u00f6dl, On the arc-chromatic number of a digraph,J. Combin. Th. (B),31 (1981), 190\u2013198.","journal-title":"J. Combin. Th. (B)"},{"key":"BF02122553_CR20","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0095-8956(84)90056-X","volume":"37","author":"E. Welzl","year":"1984","unstructured":"E. Welzl, Symmetric graphs and interpretations,J. Combin. Th. (B),37 (1984), 235\u2013744.","journal-title":"J. Combin. Th. (B)"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122553.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02122553\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02122553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:22:27Z","timestamp":1557782547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02122553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["BF02122553"],"URL":"https:\/\/doi.org\/10.1007\/bf02122553","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}