{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:01Z","timestamp":1725455581509},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024502","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"242-257","source":"Crossref","is-referenced-by-count":16,"title":["Complexity of colored graph covers I. Colored directed multigraphs"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kratochv\u00edl","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"21_CR1","first-page":"103","volume":"4","author":"J. Abello","year":"1991","unstructured":"J. Abello, M.R. Fellows and J.C. Stillwell, On the complexity and combinatorics of covering finite complexes, Australasian Journal of Combinatorics 4 (1991), 103\u2013112","journal-title":"Australasian Journal of Combinatorics"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"D. Angluin, Local and global properties in networks of processors, in Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82\u201393","DOI":"10.1145\/800141.804655"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0095-8956(81)90062-9","volume":"30","author":"D. Angluin","year":"1981","unstructured":"D. Angluin and A. Gardner, Finite common coverings of pairs of regular graphs, Journal of Combinatorial Theory B 30 (1981), 184\u2013187","journal-title":"Journal of Combinatorial Theory B"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"N. Biggs, Algebraic Graph Theory, Cambridge University Press, 1974","DOI":"10.1017\/CBO9780511608704"},{"key":"21_CR5","unstructured":"M.R. Carey and D.S. Johnson, Computers and Intractability, W.H.Freeman and Co., 1978"},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"4","author":"I. Holyer","year":"1981","unstructured":"I. Holyer, The NP-completeness of edge-coloring, SIAM J. Computing 4 (1981), 718\u2013720","journal-title":"SIAM J. Computing"},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0012-365X(94)90026-4","volume":"133","author":"J. Kratochv\u00edl","year":"1994","unstructured":"J. Kratochv\u00edl: Regular codes in regular graphs are difficult, Discrete Math. 133 (1994), 191\u2013205","journal-title":"Discrete Math."},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/3-540-59071-4_40","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kratochv\u00edl","year":"1995","unstructured":"J. Kratochv\u00edl, A. Proskurowski, J.A. Telle: On the complexity of graph covering problems, In: Graph-Theoretic Concepts in Computer Science, Proceedings of 20th International Workshop WG'94, Munchen, Germany, 1994, Lecture Notes in Computer Science 903, Springer Verlag, Berlin Heidelberg, 1995, pp. 93\u2013105."},{"key":"21_CR9","unstructured":"J. Kratochv\u00edl, A. Proskurowski, J.A. Telle: Covering regular graphs, to appear in Journal of Combin. Theory Ser. B"},{"key":"21_CR10","unstructured":"J. Kratochv\u00edl, A. Proskurowski, J.A. Telle: Complexity of colored graph covers II. When 2-SAT helps. (in preparation)"},{"key":"21_CR11","unstructured":"J. Kratochv\u00edl, A. Proskurowski, J. A. Telle: Complexity of colored graph covers III. Three-vertex graphs. (in preparation)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024502","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:35:33Z","timestamp":1586554533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0024502","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}