{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:58:06Z","timestamp":1760245086036},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114083"},{"type":"electronic","value":"9783642114090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11409-0_28","type":"book-chapter","created":{"date-parts":[[2009,12,3]],"date-time":"2009-12-03T13:12:27Z","timestamp":1259845947000},"page":"320-328","source":"Crossref","is-referenced-by-count":2,"title":["Cycles, Paths, Connectivity and Diameter in Distance Graphs"],"prefix":"10.1007","author":[{"given":"Lucia Draque","family":"Penso","sequence":"first","affiliation":[]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[]},{"given":"Jayme Luiz","family":"Szwarcfiter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1985","unstructured":"Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed Loop Computer Networks: A Survey. J. of Parallel and Distributed Computing\u00a024, 2\u201310 (1985)","journal-title":"J. of Parallel and Distributed Computing"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F. Boesch","year":"1984","unstructured":"Boesch, F., Tindell, R.: Circulants and their connectivities. J. Graph Theory\u00a08, 487\u2013499 (1984)","journal-title":"J. Graph Theory"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-540-30559-0_24","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V.E. Brimkov","year":"2004","unstructured":"Brimkov, V.E., Barneva, R.P., Klette, R., Straight, J.: Efficient computation of the lov\u00e1sz theta function for a class of circulant graphs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 285\u2013295. Springer, Heidelberg (2004)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0166-218X(91)90024-Q","volume":"32","author":"R.E. Burkard","year":"1991","unstructured":"Burkard, R.E., Sandholzer, W.: Efficiently solvable special cases of bottleneck travelling salesman problems. Discrete Appl. Math.\u00a032, 61\u201376 (1991)","journal-title":"Discrete Appl. Math."},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-46784-X_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Cohen","year":"1999","unstructured":"Cohen, J., Fraigniaud, P., Gavoille, C.: Recognizing Bipartite Incident-Graphs of Circulant Digraphs. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol.\u00a01665, pp. 215\u2013227. Springer, Heidelberg (1999)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0012-365X(96)00170-7","volume":"165\/166","author":"W. Deuber","year":"1997","unstructured":"Deuber, W., Zhu, X.: The chromatic number of distance graphs. Discrete Math.\u00a0165\/166, 195\u2013204 (1997)","journal-title":"Discrete Math."},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"R.B. Eggleton","year":"1985","unstructured":"Eggleton, R.B., Erd\u0151s, P., Skilton, D.K.: Coloring the real line. J. Combin. Theory Ser. B\u00a039, 86\u2013100 (1985)","journal-title":"J. Combin. Theory Ser. B"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1090\/S1061-0022-04-00833-7","volume":"15","author":"S.A. Evdokimov","year":"2004","unstructured":"Evdokimov, S.A., Ponomarenko, I.N.: Circulant graphs: recognizing and isomorphism testing in polynomial time (English. Russian original). St. Petersbg. Math. J.\u00a015, 813\u2013835 (2004); translation from Algebra Anal. 15, 1\u201334 (2003)","journal-title":"St. Petersbg. Math. J."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.25.5.741","volume":"25","author":"R.S. Garfinkel","year":"1977","unstructured":"Garfinkel, R.S.: Minimizing wallpaper waste, part I: A class of traveling salesman problems. Oper. Res.\u00a025, 741\u2013751 (1977)","journal-title":"Oper. Res."},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/10692760_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Gauyacq","year":"1998","unstructured":"Gauyacq, G., Micheneau, C., Raspaud, A.: Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 227\u2013241. Springer, Heidelberg (1998)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-3-540-30559-0_25","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.J. Golin","year":"2004","unstructured":"Golin, M.J., Leung, Y.-C.: Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 296\u2013307. Springer, Heidelberg (2004)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(00)00243-7","volume":"263","author":"F.K. Hwang","year":"2001","unstructured":"Hwang, F.K.: A complementary survey on double-loop networks. Theoret. Comput. Sci.\u00a0263, 211\u2013229 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0304-3975(01)00341-3","volume":"299","author":"F.K. Hwang","year":"2003","unstructured":"Hwang, F.K.: A survey on multi-loop networks. Theoret. Comput. Sci.\u00a0299, 107\u2013121 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR14","first-page":"75","volume":"151","author":"A. Kemnitz","year":"2001","unstructured":"Kemnitz, A., Marangio, M.: Colorings and list colorings of integer distance graphs. Congr. Numerantium\u00a0151, 75\u201384 (2001)","journal-title":"Congr. Numerantium"},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra, H.W.: Integer programming with a fixed number of variables. Mathematics of Operations Research\u00a08, 538\u2013548 (1983)","journal-title":"Mathematics of Operations Research"},{"key":"28_CR16","series-title":"Advances in Computers","first-page":"163","volume-title":"Distributed Loop Computer Networks","author":"M.T. Liu","year":"1981","unstructured":"Liu, M.T.: Distributed Loop Computer Networks. Advances in Computers, vol.\u00a017, pp. 163\u2013221. Academic Press, New York (1981)"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0024611503014412","volume":"88","author":"M. Muzychuk","year":"2004","unstructured":"Muzychuk, M.: A solution of the isomorphism problem for circulant graphs. Proc. Lond. Math. Soc., III. Ser.\u00a088, 1\u201341 (2004)","journal-title":"Proc. Lond. Math. Soc., III. Ser."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0169-7552(86)90027-9","volume":"11","author":"C.S. Raghavendra","year":"1986","unstructured":"Raghavendra, C.S., Sylvester, J.A.: A survey of multi-connected loop topologies for local computer networks. Comput. Network ISDN Syst.\u00a011, 29\u201342 (1986)","journal-title":"Comput. Network ISDN Syst."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1002\/jgt.3190100103","volume":"10","author":"E.A. Dorne van","year":"1986","unstructured":"van Dorne, E.A.: Connectivity of circulant graphs. J. Graph Theory\u00a010, 9\u201314 (1986)","journal-title":"J. Graph Theory"},{"key":"28_CR20","unstructured":"van Emde Boas, P.: Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Technical Report 81-04, Mathematisch Instituut, Amsterdam, Netherlands (1981)"},{"key":"28_CR21","first-page":"3","volume":"52","author":"M. Voigt","year":"1999","unstructured":"Voigt, M.: Colouring of distance graphs. Ars Combin.\u00a052, 3\u201312 (1999)","journal-title":"Ars Combin."},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/3-540-36379-3_36","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Wanka","year":"2002","unstructured":"Wanka, R.: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 413\u2013420. Springer, Heidelberg (2002)"},{"key":"28_CR23","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1145\/321832.321838","volume":"21","author":"C.K. Wong","year":"1974","unstructured":"Wong, C.K., Coppersmith, D.: A combinatorial problem related to multimode memory organizations. J. ACM\u00a021, 392\u2013402 (1974)","journal-title":"J. ACM"}],"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\/978-3-642-11409-0_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:52:04Z","timestamp":1619783524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11409-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114083","9783642114090"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11409-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}