{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:32:55Z","timestamp":1742970775383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319218397"},{"type":"electronic","value":"9783319218403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21840-3_7","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T09:57:38Z","timestamp":1437991058000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generation of Colourings and Distinguishing Colourings of Graphs"],"prefix":"10.1007","author":[{"given":"William","family":"Bird","sequence":"first","affiliation":[]},{"given":"Wendy","family":"Myrvold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"issue":"R18","key":"7_CR1","first-page":"1","volume":"3","author":"MO Albertson","year":"1996","unstructured":"Albertson, M.O., Collins, K.L.: Symmetry breaking in graphs. Electronic Journal of Combinatorics 3(R18), 1\u201317 (1996)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"4","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1137\/07068686X","volume":"22","author":"V Arvind","year":"2008","unstructured":"Arvind, V., Cheng, C.T., Devanur, N.R.: On computing the distinguishing numbers of planar graphs and beyond: A counting approach. SIAM Journal on Discrete Mathematics 22(4), 1297\u20131324 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.disc.2003.11.018","volume":"283","author":"B Bogstad","year":"2004","unstructured":"Bogstad, B., Cowen, L.: The distinguishing number of the hypercube. Discrete Mathematics 283(1), 29\u201335 (2004)","journal-title":"Discrete Mathematics"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Fundamental Algorithms for Permutation Groups","year":"1991","unstructured":"Butler, G. (ed.): Fundamental Algorithms for Permutation Groups. LNCS, vol. 559. Springer, Heidelberg (1991)"},{"issue":"R70","key":"7_CR5","first-page":"1","volume":"13","author":"M Chan","year":"2006","unstructured":"Chan, M.: The maximum distinguishing number of a group. Electronic Journal of Combinatorics 13(R70), 1\u20138 (2006)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"11","key":"7_CR6","doi-asserted-by":"publisher","first-page":"2330","DOI":"10.1016\/j.disc.2006.09.056","volume":"308","author":"M Chan","year":"2008","unstructured":"Chan, M.: The distinguishing number of the augmented cube and hypercube powers. Discrete Mathematics 308(11), 2330\u20132336 (2008)","journal-title":"Discrete Mathematics"},{"issue":"R11","key":"7_CR7","first-page":"1","volume":"13","author":"CT Cheng","year":"2006","unstructured":"Cheng, C.T.: On computing the distinguishing numbers of trees and forests. Electronic Journal of Combinatorics 13(R11), 1\u201312 (2006)","journal-title":"Electronic Journal of Combinatorics"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutation groups. In: 21st Annual Symposium on Foundations of Computer Science, pp. 36\u201341, October 1980","DOI":"10.1109\/SFCS.1980.34"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/inco.1993.1045","volume":"105","author":"L Goldberg","year":"1993","unstructured":"Goldberg, L.: Automating P\u00f3lya theory: The computational complexity of the cycle index polynomial. Information and Computation 105(2), 268\u2013288 (1993)","journal-title":"Information and Computation"},{"key":"7_CR10","volume-title":"The Theory of Groups","author":"M Hall","year":"1959","unstructured":"Hall, M.: The Theory of Groups. Macmillan, New York (1959)"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0196-6774(86)90038-6","volume":"7","author":"M Jerrum","year":"1986","unstructured":"Jerrum, M.: A compact representation for permutation groups. Journal of Algorithms 7(1), 60\u201378 (1986)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01375471","volume":"11","author":"DE Knuth","year":"1991","unstructured":"Knuth, D.E.: Efficient representation of perm groups. Combinatorica 11(1), 33\u201343 (1991)","journal-title":"Combinatorica"},{"key":"7_CR13","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4A. Addison-Wesley, Reading (2011)"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-1-4757-2497-4_6","volume":"368","author":"W Kocay","year":"1996","unstructured":"Kocay, W.: On writing isomorphism programs. Computational and Constructive Design Theory 368, 135\u2013175 (1996)","journal-title":"Computational and Constructive Design Theory"},{"key":"7_CR15","first-page":"45","volume":"30","author":"B McKay","year":"1981","unstructured":"McKay, B.: Practical graph isomorphism. Congressus Numerantium 30, 45\u201387 (1981)","journal-title":"Congressus Numerantium"},{"key":"7_CR16","first-page":"173","volume":"85","author":"W Myrvold","year":"2013","unstructured":"Myrvold, W., Fowler, P.: Fast enumeration of all independent sets of a graph up to isomorphism. Journal of Combinatorial Mathematics and Combinatorial Computing 85, 173\u2013194 (2013)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"7_CR17","unstructured":"Potanka, K.S.: Groups, Graphs, and Symmetry-Breaking. Master\u2019s thesis, Virginia Polytechnic Institute and State University (1998)"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0747-7171(89)80033-1","volume":"8","author":"GF Royle","year":"1989","unstructured":"Royle, G.F., Praeger, C.E.: Constructing the vertex-transitive graphs of order 24. Journal of Symbolic Computation 8(4), 309\u2013326 (1989)","journal-title":"Journal of Symbolic Computation"},{"issue":"R23","key":"7_CR19","first-page":"1","volume":"5","author":"A Russell","year":"1998","unstructured":"Russell, A., Sundaram, R.: A note on the asymptotics and computational complexity of graph distinguishability. Electronic Journal of Combinatorics 5(R23), 1\u20137 (1998)","journal-title":"Electronic Journal of Combinatorics"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computation with permutation groups. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, pp. 23\u201328. ACM (1971)","DOI":"10.1145\/800204.806264"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 169\u2013183. Pergamon Press (1970)","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"issue":"R63","key":"7_CR22","first-page":"1","volume":"11","author":"J Tymoczko","year":"2004","unstructured":"Tymoczko, J.: Distinguishing numbers for graphs and groups. Electronic Journal of Combinatorics 11(R63), 1\u201313 (2004)","journal-title":"Electronic Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21840-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:59:13Z","timestamp":1676973553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21840-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319218397","9783319218403"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21840-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}