{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:37Z","timestamp":1725560377022},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_30","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:05:47Z","timestamp":1127815547000},"page":"340-351","source":"Crossref","is-referenced-by-count":3,"title":["Matrix and Graph Orders Derived from Locally Constrained Graph Homomorphisms"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Fiala","sequence":"first","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82\u201393 (1980)","DOI":"10.1145\/800141.804655"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/0095-8956(81)90062-9","volume":"30","author":"D. Angluin","year":"1981","unstructured":"Angluin, D., Gardiner, A.: Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B\u00a030, 184\u2013187 (1981)","journal-title":"Journal of Combinatorial Theory B"},{"key":"30_CR3","unstructured":"Bastert, O.: Computing equitable partitions of graphs. Communications in Mathematical and in Computer Chemistry\u00a0(40), 265\u2013272 (1999)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/jlms\/s2-26.2.193","volume":"26","author":"N. Biggs","year":"1982","unstructured":"Biggs, N.: Constructing 5-arc transitive cubic graphs. Journal of London Mathematical Society II\u00a026, 193\u2013200 (1982)","journal-title":"Journal of London Mathematical Society II"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0743-7315(89)90048-8","volume":"6","author":"H.L. Bodlaender","year":"1989","unstructured":"Bodlaender, H.L.: The classification of coverings of processor networks. Journal of Parallel Distributed Computing\u00a06, 166\u2013182 (1989)","journal-title":"Journal of Parallel Distributed Computing"},{"key":"30_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Macmillan, London, Elsevier, New York (1976)"},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0165-4896(91)90080-B","volume":"21","author":"M.G. Everett","year":"1991","unstructured":"Everett, M.G., Borgatti, S.: Role coloring a graph. Mathematical Social Sciences\u00a021(2), 183\u2013188 (1991)","journal-title":"Mathematical Social Sciences"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45678-3_46","volume-title":"Algorithms and Computation","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J.: Complexity of partial covers of graphs. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol.\u00a02223, pp. 537\u2013549. Springer, Heidelberg (2001)"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"89","DOI":"10.7151\/dmgt.1159","volume":"22","author":"J. Fiala","year":"2002","unstructured":"Fiala, J., Kratochv\u00edl, J.: Partial covers of graphs. Discussiones Mathematicae Graph Theory\u00a022, 89\u201399 (2002)","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kratochv\u00edl, J., Kloks, T.: Fixed-parameter complexity of \u03bb-labelings. Discrete Applied Mathematics\u00a0113(1), 59\u201372 (2001)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR11","unstructured":"Fiala, J., Maxov\u00e1, J.: Cantor-Bernstein type theorem for locally constrained graph homomorphisms. preprint (2003), http:\/\/kam.mff.cuni.cz\/fiala\/papers\/cantor.ps"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. In: Theoretical Computer Science (to appear )","DOI":"10.1016\/j.tcs.2005.09.029"},{"key":"30_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11604686_11","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Paulusma, D., Telle, J.A.: Algorithms for comparability of matrices in partial orders imposed by graph homomorphisms. In: Kratsch, D. (ed.) WG 2005. LNCS, vol.\u00a03787, pp. 115\u2013126. Springer, Heidelberg (2005)"},{"key":"30_CR14","volume-title":"Algebraic Combinatorics","author":"C. Godsil","year":"1993","unstructured":"Godsil, C.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P. Hell","year":"1990","unstructured":"Hell, P., Nesetril, J.: On the complexity of H-colouring. Journal of Combinatorial Theory, Series B\u00a048, 92\u2013110 (1990)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"30_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford University Press, Oxford (2004)"},{"issue":"1","key":"30_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jctb.1996.1743","volume":"71","author":"J. Kratochv\u00edl","year":"1997","unstructured":"Kratochv\u00edl, J., Proskurowski, A., Telle, J.A.: Covering regular graphs. Journal of Combinatorial Theory B\u00a071(1), 1\u201316 (1997)","journal-title":"Journal of Combinatorial Theory B"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/3-540-40996-3_39","volume-title":"Algorithms and Computation","author":"P. Kristiansen","year":"2000","unstructured":"Kristiansen, P., Telle, J.A.: Generalized H-coloring of graphs. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 456\u2013466. Springer, Heidelberg (2000)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0095-8956(82)90042-9","volume":"33","author":"F.T. Leighton","year":"1982","unstructured":"Leighton, F.T.: Finite common coverings of graphs. Journal of Combinatorial Theory B\u00a033, 231\u2013238 (1982)","journal-title":"Journal of Combinatorial Theory B"},{"issue":"3","key":"30_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0012-365X(71)90014-8","volume":"1","author":"J. Ne\u0161et\u0159il","year":"1971","unstructured":"Ne\u0161et\u0159il, J.: Homomorphisms of derivative graphs. Discrete Mathematics\u00a01(3), 257\u2013268 (1971)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:41:15Z","timestamp":1605624075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11549345_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}