{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:09:19Z","timestamp":1649214559208},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1980,5,1]],"date-time":"1980-05-01T00:00:00Z","timestamp":325987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12130,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,5]]},"DOI":"10.1016\/0304-3975(80)90039-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"93-106","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of dimension three and some related edge-covering characteristics of graphs"],"prefix":"10.1016","volume":"11","author":[{"given":"Lud\u011bk","family":"Ku\u010dera","sequence":"first","affiliation":[]},{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[]},{"given":"Ale\u0161","family":"Pultr","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90039-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(80)90039-0_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(80)90039-0_BIB3","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","article-title":"Partially ordered sets","volume":"63","author":"Dushnik","year":"1941","journal-title":"Amer. J. Math."},{"issue":"1","key":"10.1016\/0304-3975(80)90039-0_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(80)90039-0_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(80)90039-0_BIB6","series-title":"Proc. 5th South Eastern on Comb., Graph Th. and Comp.","first-page":"513","article-title":"Worst case behavior of graph colouring algorithms","author":"Johnson","year":"1974"},{"key":"10.1016\/0304-3975(80)90039-0_BIB7","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(80)90039-0_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"key":"10.1016\/0304-3975(80)90039-0_BIB9","unstructured":"L. Lov\u00e1sz, J. Ne\u0161et\u0159il and A. Pultr, On a product dimension of graphs, J. Combinatorial Theory, to appear."},{"key":"10.1016\/0304-3975(80)90039-0_BIB10","series-title":"Fundamentals of Computational Theories","first-page":"482","article-title":"A Dushnik-Miller type dimension of graphs and its complexity","volume":"56","author":"Ne\u0161et\u0159il","year":"1977"},{"key":"10.1016\/0304-3975(80)90039-0_BIB11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(78)90186-3","article-title":"A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph","volume":"23","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(80)90039-0_BIB12","article-title":"Theory of graphs","volume":"Vol. XXXVIII","author":"Ore","year":"1962"},{"issue":"3","key":"10.1016\/0304-3975(80)90039-0_BIB13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/1008293.1008294","article-title":"Planar 3-colorability is polynomial complete","volume":"5","author":"Stockmeyer","year":"1973","journal-title":"Sigact News"},{"key":"10.1016\/0304-3975(80)90039-0_BIB14","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:24:26Z","timestamp":1555125866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,5]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,5]]}},"alternative-id":["0304397580900390"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90039-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,5]]}}}