{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T04:13:02Z","timestamp":1765253582579},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540084426"},{"type":"electronic","value":"9783540370840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08442-8_119","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:29:00Z","timestamp":1330187340000},"page":"482-493","source":"Crossref","is-referenced-by-count":9,"title":["A Dushnik - Miller type dimension of graphs and its complexity"],"prefix":"10.1007","author":[{"given":"J.","family":"Ne\u0161et\u0159il","sequence":"first","affiliation":[]},{"given":"A.","family":"Pultr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"56_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(76)90139-4","volume":"16","author":"L. W. Beineke","year":"1976","unstructured":"L.W. Beineke and S. Fiorini: On small graphs critical with respect to edge colourings, Discr.Math. 16 (1976), 109\u2013122","journal-title":"Discr.Math."},{"key":"56_CR2","doi-asserted-by":"crossref","first-page":"600","DOI":"10.2307\/2371374","volume":"63","author":"B. Dushnik","year":"1941","unstructured":"Ben Dushnik and E.W. Miller: Partially ordered sets, Amer.J. of Math. 63 (1941), 600\u2013610","journal-title":"Amer.J. of Math."},{"key":"56_CR3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0067362","volume":"303","author":"R. L. Graham","year":"1972","unstructured":"R.L. Graham and H.O. Pollak: On embedding graphs in squashed cubes, Graph Theory and Applications, Lecture Notes in Math. 303, Springer 1972, 99\u2013110","journal-title":"Lecture Notes in Math."},{"key":"56_CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R. Karp","year":"1972","unstructured":"R. Karp: Reducibility among combinatorial problems, in: Complexity of Computer Computation, Plenum Press (New York), 1972, 85\u2013103"},{"key":"56_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.2307\/2372194","volume":"70","author":"H. Komm","year":"1948","unstructured":"H. Komm: On the dimension of partially ordered sets, Amer.J. of Math. 70 (1948), 507\u2013520","journal-title":"Amer.J. of Math."},{"key":"56_CR6","unstructured":"J.Ne\u0161et\u0159il and A.Pultr: On classes of relations and graphs determined by subobjects and factorobjects, submitted to Discr.Math."},{"key":"56_CR7","unstructured":"J.Ne\u0161et\u0159il and V.R\u00f6dl: A simple proof of the Galvin-Ramsey property of the class of all finite graphs and a dimension of a graph, to appear in Discr.Math."},{"key":"56_CR8","doi-asserted-by":"crossref","first-page":"587","DOI":"10.21136\/CMJ.1963.100589","volume":"13","author":"V. Nov\u00e1k","year":"1963","unstructured":"V. Nov\u00e1k: On the pseudodimension of ordered sets, Czech.Math. J. 13 (1963), 587\u2013597","journal-title":"Czech.Math. J."},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"O. Ore: Theory of graphs, AMS Colloq.Publ.Vol.XXXVIII, Providence, Rhode Island, 1962","DOI":"10.1090\/coll\/038"},{"key":"56_CR10","unstructured":"A.Pultr and J.Vin\u00e1rek: Productive classes and subdirect irreducibility, in particular for graphs, to appear in Discr.Math."},{"key":"56_CR11","first-page":"33","volume":"52","author":"W. T. Trotter Jr.","year":"1975","unstructured":"W.T. Trotter, Jr.: A note on Dilworth's embedding theorem, Proc. of the AMS 52 (1975), 33\u201339","journal-title":"Proc. of the AMS"},{"key":"56_CR12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(75)90031-X","volume":"12","author":"W. T. Trotter Jr.","year":"1975","unstructured":"W.T. Trotter, Jr.: Embedding finite posets in cubes, Discr. Math. 12 (1975), 165\u2013172","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08442-8_119.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T00:51:58Z","timestamp":1640911918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08442-8_119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540084426","9783540370840"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-08442-8_119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}