{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T04:41:22Z","timestamp":1773808882595,"version":"3.50.1"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T00:00:00Z","timestamp":1565740800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["PDF\/2015\/001079\/LS"],"award-info":[{"award-number":["PDF\/2015\/001079\/LS"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s00500-019-04278-8","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T17:30:50Z","timestamp":1565803850000},"page":"603-625","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Graph coloring: a novel heuristic based on trailing path\u2014properties, perspective and applications in structured networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Abhirup","family":"Bandyopadhyay","sequence":"first","affiliation":[]},{"given":"Amit kumar","family":"Dhar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1393-1982","authenticated-orcid":false,"given":"Sankar","family":"Basu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"4278_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert R, Barab\u00e1si A-L (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47\u201397. https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev Mod Phys"},{"key":"4278_CR2","doi-asserted-by":"crossref","unstructured":"Albertson MO, Cranston DW, Fox J (2010) Crossings, colorings, and cliques. ArXiv10063783 Math","DOI":"10.37236\/134"},{"key":"4278_CR3","doi-asserted-by":"crossref","unstructured":"Andreev K, R\u00e4cke H (2004) Balanced graph partitioning. In: Proceedings of the sixteenth annual ACM symposium on parallelism in algorithms and architectures. ACM, New York, pp 120\u2013124","DOI":"10.1145\/1007912.1007931"},{"key":"4278_CR4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel K, Haken W (1977) Every planar map is four colorable. Part I: discharging. Ill J Math 21:429\u2013490","journal-title":"Ill J Math"},{"key":"4278_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"Arora S, Barak B (2009) Computational complexity: a modern approach, 1st edn. Cambridge University Press, New York","edition":"1"},{"key":"4278_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.jmb.2003.08.013","volume":"333","author":"R Banerjee","year":"2003","unstructured":"Banerjee R, Sen M, Bhattacharya D, Saha P (2003) The jigsaw puzzle model: search for conformational specificity in protein interiors. J Mol Biol 333:211\u2013226","journal-title":"J Mol Biol"},{"key":"4278_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1186\/1471-2105-12-195","volume":"12","author":"S Basu","year":"2011","unstructured":"Basu S, Bhattacharyya D, Banerjee R (2011) Mapping the distribution of packing topologies within protein interiors shows predominant preference for specific packing motifs. BMC Bioinform 12:195. https:\/\/doi.org\/10.1186\/1471-2105-12-195","journal-title":"BMC Bioinform"},{"key":"4278_CR8","doi-asserted-by":"publisher","first-page":"2605","DOI":"10.1016\/j.bpj.2012.04.029","volume":"102","author":"S Basu","year":"2012","unstructured":"Basu S, Bhattacharyya D, Banerjee R (2012) Self-complementarity within proteins: bridging the gap between binding and folding. Biophys J 102:2605\u20132614. https:\/\/doi.org\/10.1016\/j.bpj.2012.04.029","journal-title":"Biophys J"},{"key":"4278_CR9","first-page":"188","volume":"51","author":"S Basu","year":"2014","unstructured":"Basu S, Bhattacharyya D, Banerjee R (2014) Applications of complementarity plot in error detection and structure validation of proteins. Indian J Biochem Biophys 51:188\u2013200","journal-title":"Indian J Biochem Biophys"},{"key":"4278_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/bip.21731","volume":"98","author":"WM Berhanu","year":"2012","unstructured":"Berhanu WM, Masunov AE (2012) Alternative packing modes leading to amyloid polymorphism in five fragments studied with molecular dynamics. Biopolymers 98:131\u2013144. https:\/\/doi.org\/10.1002\/bip.21731","journal-title":"Biopolymers"},{"key":"4278_CR11","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","volume":"28","author":"HM Berman","year":"2000","unstructured":"Berman HM, Westbrook J, Feng Z et al (2000) The protein data bank. Nucleic Acids Res 28:235\u2013242. https:\/\/doi.org\/10.1093\/nar\/28.1.235","journal-title":"Nucleic Acids Res"},{"key":"4278_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1107\/S0021889887086783","volume":"20","author":"M Blum","year":"1987","unstructured":"Blum M, Metcalf P, Harrison SC, Wiley DC (1987) A system for collection and on-line integration of X-ray diffraction data from a multiwire area detector. J Appl Crystallogr 20:235\u2013242. https:\/\/doi.org\/10.1107\/S0021889887086783","journal-title":"J Appl Crystallogr"},{"key":"4278_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0195-6698(80)80001-1","volume":"1","author":"B Bollob\u00e1s","year":"1980","unstructured":"Bollob\u00e1s B, Catlin PA, Erd\u00f6s P (1980) Hadwiger\u2019s conjecture is true for almost every graph. Eur J Comb 1:195\u2013199. https:\/\/doi.org\/10.1016\/S0195-6698(80)80001-1","journal-title":"Eur J Comb"},{"key":"4278_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22:251\u2013256. https:\/\/doi.org\/10.1145\/359094.359101","journal-title":"Commun ACM"},{"key":"4278_CR15","doi-asserted-by":"publisher","first-page":"1175","DOI":"10.1007\/s10955-013-0749-1","volume":"151","author":"K Choroma\u0144ski","year":"2013","unstructured":"Choroma\u0144ski K, Matuszak M, Mi\u0229kisz J (2013) Scale-free graph with preferential attachment and evolving internal vertex structure. J Stat Phys 151:1175\u20131183. https:\/\/doi.org\/10.1007\/s10955-013-0749-1","journal-title":"J Stat Phys"},{"key":"4278_CR16","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/070710111","volume":"51","author":"A Clauset","year":"2009","unstructured":"Clauset A, Shalizi CR, Newman MEJ (2009) Power-law distributions in empirical data. SIAM Rev 51:661\u2013703. https:\/\/doi.org\/10.1137\/070710111","journal-title":"SIAM Rev"},{"key":"4278_CR17","unstructured":"Crick FHC, IUCr (1953) The packing of -helices: simple coiled-coils. In: Acta crystallogr. http:\/\/scripts.iucr.org\/cgi-bin\/paper?S0365110X53001964 . Accessed 30 Nov 2016"},{"key":"4278_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0012-365X(80)90236-8","volume":"30","author":"DP Dailey","year":"1980","unstructured":"Dailey DP (1980) Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math 30:289\u2013293. https:\/\/doi.org\/10.1016\/0012-365X(80)90236-8","journal-title":"Discrete Math"},{"key":"4278_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.tcs.2013.04.018","volume":"540\u2013541","author":"M Demange","year":"2014","unstructured":"Demange M, Monnot J, Pop P, Ries B (2014) On the complexity of the selective graph coloring problem in some special classes of graphs. Theor Comput Sci 540\u2013541:89\u2013102. https:\/\/doi.org\/10.1016\/j.tcs.2013.04.018","journal-title":"Theor Comput Sci"},{"key":"4278_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.camwa.2011.11.028","volume":"63","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, Gao J et al (2012a) A novel parallel hybrid intelligence optimization algorithm for a function approximation problem. Comput Math Appl 63:325\u2013336. https:\/\/doi.org\/10.1016\/j.camwa.2011.11.028","journal-title":"Comput Math Appl"},{"key":"4278_CR21","doi-asserted-by":"publisher","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng W, Chen R, He B et al (2012b) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 16:1707\u20131722. https:\/\/doi.org\/10.1007\/s00500-012-0855-z","journal-title":"Soft Comput"},{"key":"4278_CR22","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.chemolab.2013.07.004","volume":"128","author":"W Deng","year":"2013","unstructured":"Deng W, Yang X, Zou L et al (2013) An improved self-adaptive differential evolution algorithm and its application. Chemom Intell Lab Syst 128:66\u201376. https:\/\/doi.org\/10.1016\/j.chemolab.2013.07.004","journal-title":"Chemom Intell Lab Syst"},{"key":"4278_CR23","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00500-014-1294-9","volume":"19","author":"W Deng","year":"2015","unstructured":"Deng W, Zhao H, Liu J et al (2015) An improved CACO algorithm based on adaptive method and multi-variant strategies. Soft Comput 19:701\u2013713. https:\/\/doi.org\/10.1007\/s00500-014-1294-9","journal-title":"Soft Comput"},{"key":"4278_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2940-9","author":"W Deng","year":"2017","unstructured":"Deng W, Yao R, Zhao H et al (2017a) A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-017-2940-9","journal-title":"Soft Comput"},{"key":"4278_CR25","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.asoc.2017.06.004","volume":"59","author":"W Deng","year":"2017","unstructured":"Deng W, Zhao H, Yang X et al (2017b) Study on an Improved adaptive PSO algorithm for solving multi-objective gate assignment. Appl Soft Comput 59:288\u2013302. https:\/\/doi.org\/10.1016\/j.asoc.2017.06.004","journal-title":"Appl Soft Comput"},{"key":"4278_CR26","doi-asserted-by":"publisher","first-page":"4387","DOI":"10.1007\/s00500-016-2071-8","volume":"21","author":"W Deng","year":"2017","unstructured":"Deng W, Zhao H, Zou L et al (2017c) A novel collaborative optimization algorithm in solving complex optimization problems. Soft Comput 21:4387\u20134398. https:\/\/doi.org\/10.1007\/s00500-016-2071-8","journal-title":"Soft Comput"},{"key":"4278_CR27","doi-asserted-by":"publisher","first-page":"35042","DOI":"10.1109\/ACCESS.2018.2834540","volume":"6","author":"W Deng","year":"2018","unstructured":"Deng W, Zhang S, Zhao H, Yang X (2018) A novel fault diagnosis method based on integrating empirical wavelet transform and fuzzy entropy for motor bearing. IEEE Access 6:35042\u201335056. https:\/\/doi.org\/10.1109\/ACCESS.2018.2834540","journal-title":"IEEE Access"},{"key":"4278_CR28","doi-asserted-by":"publisher","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","volume":"7","author":"W Deng","year":"2019","unstructured":"Deng W, Xu J, Zhao H (2019) An improved ant colony optimization algorithm based on hybrid strategies for scheduling problem. IEEE Access 7:20281\u201320292. https:\/\/doi.org\/10.1109\/ACCESS.2019.2897580","journal-title":"IEEE Access"},{"key":"4278_CR29","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz J, Petit J, Serna M (2002) A survey of graph layout problems. ACM Comput Surv 34:313\u2013356. https:\/\/doi.org\/10.1145\/568522.568523","journal-title":"ACM Comput Surv"},{"key":"4278_CR30","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.1219021","volume":"338","author":"KA Dill","year":"2012","unstructured":"Dill KA, MacCallum JL (2012) The protein-folding problem, 50 years on. Science 338:1042\u20131046. https:\/\/doi.org\/10.1126\/science.1219021","journal-title":"Science"},{"key":"4278_CR31","doi-asserted-by":"crossref","DOI":"10.1142\/5814","volume-title":"Chromatic polynomials and chromaticity of graphs","author":"FM Dong","year":"2005","unstructured":"Dong FM, Koh KM, Teo KL (2005) Chromatic polynomials and chromaticity of graphs. World Scientific, Singapore"},{"key":"4278_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.cam.2015.04.030","volume":"293","author":"S Fidanova","year":"2016","unstructured":"Fidanova S, Pop P (2016) An improved hybrid ant-local search algorithm for the partition graph coloring problem. J Comput Appl Math 293:55\u201361. https:\/\/doi.org\/10.1016\/j.cam.2015.04.030","journal-title":"J Comput Appl Math"},{"key":"4278_CR33","first-page":"DS6","volume":"1000","author":"JA Gallian","year":"2015","unstructured":"Gallian JA (2015) Graph labeling. Electron J Comb 1000:DS6","journal-title":"Electron J Comb"},{"key":"4278_CR34","doi-asserted-by":"crossref","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1974) Some simplified NP-complete problems. In: Proceedings of the sixth annual ACM symposium on theory of computing. ACM, New York, pp 47\u201363","DOI":"10.1145\/800119.803884"},{"key":"4278_CR35","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1006\/jmbi.1995.0351","volume":"249","author":"M Gerstein","year":"1995","unstructured":"Gerstein M, Tsai J, Levitt M (1995) The volume of atoms on the protein surface: calculated from simulation, using Voronoi polyhedra. J Mol Biol 249:955\u2013966. https:\/\/doi.org\/10.1006\/jmbi.1995.0351","journal-title":"J Mol Biol"},{"key":"4278_CR36","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"MM Hall\u00f3rsson","year":"1993","unstructured":"Hall\u00f3rsson MM (1993) A still better performance guarantee for approximate graph coloring. Inf Process Lett 45:19\u201323. https:\/\/doi.org\/10.1016\/0020-0190(93)90246-6","journal-title":"Inf Process Lett"},{"key":"4278_CR37","doi-asserted-by":"crossref","unstructured":"Hansen J, Kubale M, Kuszner \u0141, Nadolski A (2004) Distributed largest-first algorithm for graph coloring. In: Euro-Par 2004 parallel processing. Springer, Berlin, Heidelberg, pp 804\u2013811","DOI":"10.1007\/978-3-540-27866-5_107"},{"key":"4278_CR38","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley Publishing Company, Boston"},{"key":"4278_CR39","volume-title":"T-coloring of graphs and its applications","author":"R Janczewski","year":"2001","unstructured":"Janczewski R (2001) T-coloring of graphs and its applications. Gdansk University of Technology, ETI Faculty, Gdansk"},{"key":"4278_CR40","volume-title":"Graph coloring problems","author":"TR Jensen","year":"2011","unstructured":"Jensen TR, Toft B (2011) Graph coloring problems. Wiley, New York"},{"key":"4278_CR41","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1110\/ps.9.2.403","volume":"9","author":"X Jiang","year":"2000","unstructured":"Jiang X, Farid H, Pistor E, Farid RS (2000) A new approach to the design of uniquely folded thermally stable proteins. Protein Sci Publ Protein Soc 9:403\u2013416","journal-title":"Protein Sci Publ Protein Soc"},{"key":"4278_CR42","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW, Bohlinger JD (eds) Complexity of computer computations. Springer, New York, pp 85\u2013103"},{"key":"4278_CR44","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2369235","volume":"2","author":"AB Kempe","year":"1879","unstructured":"Kempe AB (1879) On the geographical problem of the four colours. Am J Math 2:193\u2013200. https:\/\/doi.org\/10.2307\/2369235","journal-title":"Am J Math"},{"key":"4278_CR45","doi-asserted-by":"crossref","unstructured":"Kosowski A, Manuszewski K (2004) Classical coloring of graphs. In: Graph colorings, pp 2\u201319","DOI":"10.1090\/conm\/352\/06369"},{"key":"4278_CR46","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1016\/j.disc.2006.03.052","volume":"306","author":"H-J Lai","year":"2006","unstructured":"Lai H-J, Lin J, Montgomery B et al (2006) Conditional colorings of graphs. Discrete Math 306:1997\u20132004. https:\/\/doi.org\/10.1016\/j.disc.2006.03.052","journal-title":"Discrete Math"},{"key":"4278_CR47","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-2836(71)90324-X","volume":"55","author":"B Lee","year":"1971","unstructured":"Lee B, Richards FM (1971) The interpretation of protein structures: estimation of static accessibility. J Mol Biol 55:379\u2013400","journal-title":"J Mol Biol"},{"key":"4278_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-25730-3","volume-title":"A guide to graph colouring: algorithms and applications","author":"RMR Lewis","year":"2016","unstructured":"Lewis RMR (2016) A guide to graph colouring: algorithms and applications. Springer, Berlin"},{"key":"4278_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lovasz","year":"2006","unstructured":"Lovasz L (2006) On the shannon capacity of a graph. IEEE Trans Inf Theor 25:1\u20137. https:\/\/doi.org\/10.1109\/TIT.1979.1055985","journal-title":"IEEE Trans Inf Theor"},{"key":"4278_CR50","first-page":"3","volume":"61","author":"JA MacDougall","year":"2002","unstructured":"MacDougall JA, Miller M, Wallis WD (2002) Vertex-magic total labelings of graphs. Util Math 61:3\u201321","journal-title":"Util Math"},{"key":"4278_CR51","unstructured":"Marx D (2003) Graph colouring problems and their applications in scheduling"},{"key":"4278_CR52","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0012-365X(92)00058-Y","volume":"124","author":"CJH McDiarmid","year":"1994","unstructured":"McDiarmid CJH, S\u00e1nchez-Arroyo A (1994) Total colouring regular bipartite graphs is NP-hard. Discrete Math 124:155\u2013162. https:\/\/doi.org\/10.1016\/0012-365X(92)00058-Y","journal-title":"Discrete Math"},{"key":"4278_CR53","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0021-9258(18)86000-8","volume":"49","author":"TC McIlvaine","year":"1921","unstructured":"McIlvaine TC (1921) A buffer solution for colorimetric comparison. J Biol Chem 49:183\u2013186","journal-title":"J Biol Chem"},{"key":"4278_CR54","doi-asserted-by":"crossref","first-page":"1584","DOI":"10.1002\/pro.5560050813","volume":"5","author":"M Munson","year":"1996","unstructured":"Munson M, Balasubramanian S, Fleming KG et al (1996) What makes a protein a protein? Hydrophobic core designs that specify stability and structural properties. Protein Sci Publ Protein Soc 5:1584\u20131593","journal-title":"Protein Sci Publ Protein Soc"},{"key":"4278_CR55","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci USA 103:8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci USA"},{"key":"4278_CR56","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1007\/s00018-013-1446-6","volume":"71","author":"Z Peng","year":"2014","unstructured":"Peng Z, Oldfield CJ, Xue B et al (2014) A creature with a hundred waggly tails: intrinsically disordered proteins in the ribosome. Cell Mol Life Sci 71:1477\u20131504. https:\/\/doi.org\/10.1007\/s00018-013-1446-6","journal-title":"Cell Mol Life Sci"},{"key":"4278_CR57","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/jmr.728","volume":"18","author":"M Pirun","year":"2005","unstructured":"Pirun M, Babnigg G, Stevens FJ (2005) Template-based recognition of protein fold within the midnight and twilight zones of protein sequence similarity. J Mol Recognit JMR 18:203\u2013212. https:\/\/doi.org\/10.1002\/jmr.728","journal-title":"J Mol Recognit JMR"},{"key":"4278_CR58","unstructured":"RJLipton\u2009+\u2009KWRegan (2015) A big result on graph isomorphism. In: G\u00f6dels Lost Lett. PNP. https:\/\/rjlipton.wordpress.com\/2015\/11\/04\/a-big-result-on-graph-isomorphism\/ . Accessed 30 Nov 2016"},{"key":"4278_CR59","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/protein\/12.2.85","volume":"12","author":"B Rost","year":"1999","unstructured":"Rost B (1999) Twilight zone of protein sequence alignments. Protein Eng 12:85\u201394","journal-title":"Protein Eng"},{"key":"4278_CR60","doi-asserted-by":"publisher","first-page":"e0142173","DOI":"10.1371\/journal.pone.0142173","volume":"10","author":"S Roy","year":"2015","unstructured":"Roy S, Basu S, Dasgupta D et al (2015) The unfolding MD simulations of cyclophilin: analyzed by surface contact networks and their associated metrics. PLOS ONE 10:e0142173. https:\/\/doi.org\/10.1371\/journal.pone.0142173","journal-title":"PLOS ONE"},{"key":"4278_CR61","doi-asserted-by":"publisher","first-page":"1724","DOI":"10.1016\/j.cor.2011.10.008","volume":"39","author":"P San Segundo","year":"2012","unstructured":"San Segundo P (2012) A new DSATUR-based algorithm for exact vertex coloring. Comput Oper Res 39:1724\u20131733. https:\/\/doi.org\/10.1016\/j.cor.2011.10.008","journal-title":"Comput Oper Res"},{"key":"4278_CR62","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/pl00007248","volume":"17","author":"DP Sanders","year":"2001","unstructured":"Sanders DP, Zhao Y (2001) On improving the edge-face coloring theorem. Graphs Comb 17:329\u2013341. https:\/\/doi.org\/10.1007\/pl00007248","journal-title":"Graphs Comb"},{"key":"4278_CR63","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.jctb.2005.06.003","volume":"96","author":"M Stiebitz","year":"2006","unstructured":"Stiebitz M, \u0160krekovski R (2006) A map colour theorem for the union of graphs. J Comb Theory Ser B 96:20\u201337. https:\/\/doi.org\/10.1016\/j.jctb.2005.06.003","journal-title":"J Comb Theory Ser B"},{"key":"4278_CR64","doi-asserted-by":"publisher","first-page":"R105","DOI":"10.1016\/S0969-2126(99)80062-8","volume":"7","author":"AG Street","year":"1999","unstructured":"Street AG, Mayo SL (1999) Computational protein design. Structure\u00a07:R105\u2013R109. https:\/\/doi.org\/10.1016\/S0969-2126(99)80062-8","journal-title":"Structure"},{"key":"4278_CR65","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1006\/jmbi.1999.2829","volume":"290","author":"J Tsai","year":"1999","unstructured":"Tsai J, Taylor R, Chothia C, Gerstein M (1999) The packing density in proteins: standard radii and volumes1. J Mol Biol 290:253\u2013266. https:\/\/doi.org\/10.1006\/jmbi.1999.2829","journal-title":"J Mol Biol"},{"key":"4278_CR66","first-page":"177","volume":"22","author":"WD Wallis","year":"2000","unstructured":"Wallis WD, Baskoro ET, Miller M, Slamin (2000) Edge-magic total labelings. Aust J Comb 22:177\u2013190","journal-title":"Aust J Comb"},{"key":"4278_CR67","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u201csmall-world\u201d networks. Nature 393:440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"key":"4278_CR68","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"DJA Welsh","year":"1967","unstructured":"Welsh DJA, Powell MB (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10:85\u201386. https:\/\/doi.org\/10.1093\/comjnl\/10.1.85","journal-title":"Comput J"},{"key":"4278_CR69","doi-asserted-by":"crossref","unstructured":"Zarrazola E, Gomez D, Montero J et al (2011) Network clustering by graph coloring: an application to astronomical images. In: 2011 11th international conference on intelligent systems design and applications (ISDA), pp 796\u2013801","DOI":"10.1109\/ISDA.2011.6121754"},{"key":"4278_CR70","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-20394-2","volume-title":"Color-Induced graph colorings","author":"P Zhang","year":"2015","unstructured":"Zhang P (2015) Color-Induced graph colorings. Springer, Berlin"},{"key":"4278_CR71","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1177\/0954408916637380","volume":"231","author":"H Zhao","year":"2017","unstructured":"Zhao H, Li D, Deng W, Yang X (2017a) Research on vibration suppression method of alternating current motor based on fractional order control strategy. Proc Inst Mech Eng Part E J Process Mech Eng 231:786\u2013799. https:\/\/doi.org\/10.1177\/0954408916637380","journal-title":"Proc Inst Mech Eng Part E J Process Mech Eng"},{"key":"4278_CR72","doi-asserted-by":"publisher","first-page":"14","DOI":"10.3390\/e19010014","volume":"19","author":"H Zhao","year":"2017","unstructured":"Zhao H, Sun M, Deng W, Yang X (2017b) A new feature extraction method based on EEMD and multi-scale fuzzy entropy for motor bearing. Entropy 19:14. https:\/\/doi.org\/10.3390\/e19010014","journal-title":"Entropy"},{"key":"4278_CR73","doi-asserted-by":"publisher","first-page":"682","DOI":"10.3390\/e20090682","volume":"20","author":"H Zhao","year":"2018","unstructured":"Zhao H, Yao R, Xu L et al (2018) Study on a novel fault damage degree identification method using high-order differential mathematical morphology gradient spectrum entropy. Entropy 20:682. https:\/\/doi.org\/10.3390\/e20090682","journal-title":"Entropy"},{"key":"4278_CR74","doi-asserted-by":"publisher","DOI":"10.7554\/elife.16761","author":"H Zhu","year":"2016","unstructured":"Zhu H, Sepulveda E, Hartmann MD et al (2016) Origin of a folded repeat protein from an intrinsically disordered ancestor. eLife. https:\/\/doi.org\/10.7554\/elife.16761","journal-title":"eLife"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04278-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04278-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,16]],"date-time":"2021-01-16T14:25:14Z","timestamp":1610807114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04278-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,14]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["4278"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04278-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints201805.0178.v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,14]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"None of the authors have any competing interests in the manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}