{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:26:53Z","timestamp":1648981613237},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T00:00:00Z","timestamp":1285891200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s11424-010-0211-2","type":"journal-article","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T03:40:20Z","timestamp":1289187620000},"page":"951-960","source":"Crossref","is-referenced-by-count":0,"title":["The method of coloring in graphs and its application"],"prefix":"10.1007","volume":"23","author":[{"given":"Guizhen","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianfeng","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,9]]},"reference":[{"issue":"3","key":"211_CR1","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E. G. Coffman Jr.","year":"1985","unstructured":"E. G. Coffman, Jr. M. R. Garey, D. S. Johnson, and A. S. LaPaugh, Scheduling file transfers, SIAM J. Comput., 1985, 14(3): 744\u2013780.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"211_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/31.1747","volume":"35","author":"S. Nakano","year":"1988","unstructured":"S. Nakano, T. Nishizeki, and N. Saito, On the f-coloring of multigraphs, IEEE Trans. Circuit and Syst., 1988, 35(3): 345\u2013353.","journal-title":"IEEE Trans. Circuit and Syst."},{"issue":"2","key":"211_CR3","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1142\/S0129054193000079","volume":"4","author":"S. Nakano","year":"1993","unstructured":"S. Nakano and T. Nishizeki, Scheduling file transfers under port and channel constraints, International Journal on Foundations of Computer Science, 1993, 4(2): 425\u2013431.","journal-title":"International Journal on Foundations of Computer Science"},{"issue":"1","key":"211_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02122697","volume":"10","author":"S. Nakano","year":"1990","unstructured":"S. Nakano, T. Nishizeki, and N. Saito, On the fg-coloring of graphs, Combinatorica, 1990, 10(1): 67\u201380.","journal-title":"Combinatorica"},{"key":"211_CR5","first-page":"25","volume":"3","author":"V. G. Vizing","year":"1964","unstructured":"V. G. Vizing, On an estimate of the chromatics class of a p-graph (Russian), Diskret. Analiz., 1964, 3: 25\u201330.","journal-title":"Diskret. Analiz."},{"key":"211_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/jgt.3190100202","volume":"10","author":"S. L. Hakimi","year":"1986","unstructured":"S. L. Hakimi and O. Kariv, A generalization of edge-coloring in graphs, J. Graph Theory, 1986, 10: 139\u2013154.","journal-title":"J. Graph Theory"},{"key":"211_CR7","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1090\/S0002-9904-1974-13468-3","volume":"80","author":"R. P. Gupta","year":"1974","unstructured":"R. P. Gupta, On decompositions of a multigraph into spanning subgraphs, Bull. Amer. Math. Soc., 1974, 80: 500\u2013502.","journal-title":"Bull. Amer. Math. Soc."},{"issue":"4","key":"211_CR8","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"17","author":"A. H. Gebremedhin","year":"2005","unstructured":"A. H. Gebremedhin, F. Manne, and A. Pothen, What color is your Jacobian? Graph coloring for computing derivatives, SIAM Rev., 2005, 17(4): 629\u2013705.","journal-title":"SIAM Rev."},{"key":"211_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"O. V. Borodin","year":"1979","unstructured":"O. V. Borodin, On acyclic colorings of planar graphs, Discrete Math., 1979, 25: 211\u2013236.","journal-title":"Discrete Math."},{"key":"211_CR10","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B. Gr\u00fcnbaum","year":"1973","unstructured":"B. Gr\u00fcnbaum, Acyclic colorings of planar graphs, Israel J. Math., 1973, 14: 390\u2013408.","journal-title":"Israel J. Math."},{"key":"211_CR11","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0012-365X(76)90075-3","volume":"14","author":"A. V. Kostochka","year":"1976","unstructured":"A. V. Kostochka and L. S. Mel\u2019nikov, Note to the paper of Gr\u00fcnbaum on acyclic colorings, Discrete Math., 1976, 14: 403\u2013406.","journal-title":"Discrete Math."},{"key":"211_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/rsa.3240020303","volume":"49","author":"N. Alon","year":"1991","unstructured":"N. Alon, C. J. H. McDiarmid, and B. Reed, Acyclic coloring of graphs, Random Structures Algorithms, 1991, 49: 277\u2013288.","journal-title":"Random Structures Algorithms"},{"key":"211_CR13","doi-asserted-by":"crossref","unstructured":"M. Molloy and B. Reed, Further Algorithmic Aspects of the Local Lemma, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, 524\u2013529.","DOI":"10.1145\/276698.276866"},{"key":"211_CR14","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.disc.2007.03.006","volume":"307","author":"R. Muthu","year":"2007","unstructured":"R. Muthu, N. Narayanan, and C. R. Subramanian, Improved bounds on acyclic edge coloring, Discrete Mathematics, 2007, 307: 3063\u20133069.","journal-title":"Discrete Mathematics"},{"key":"211_CR15","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jgt.1010","volume":"37","author":"N. Alon","year":"2001","unstructured":"N. Alon, B. Sudakov, and A. Zaks, Acyclic edge colorings of graphs, J. Graph Theory, 2001, 37: 157\u2013167.","journal-title":"J. Graph Theory"},{"key":"211_CR16","first-page":"21","volume":"93","author":"M. I. Burnstein","year":"1979","unstructured":"M. I. Burnstein, Every 4-valent graph has an acyclic 5-coloring (in Russian), Soob\u0161\u010d Akad Nauk Gruzin SSR, 1979, 93: 21\u201324.","journal-title":"Soob\u0161\u010d Akad Nauk Gruzin SSR"},{"issue":"5","key":"211_CR17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s11425-008-0124-x","volume":"51","author":"J. Hou","year":"2009","unstructured":"J. Hou, J. Wu, G. Liu, and B. Liu, Acyclic edge colorings of planar graphs and seriell-parallel graphs, Sciences in China Series A: Mathematics, 2009, 51(5): 605\u2013616.","journal-title":"Sciences in China Series A: Mathematics"},{"key":"211_CR18","doi-asserted-by":"crossref","unstructured":"D. Yu, J. Hou, and G. Liu, Acyclic edge coloring of planar graphs with large girth, Theoretical Computer Science, doi:10.1016\/j.tcs.2009.08.015.","DOI":"10.1016\/j.tcs.2009.08.015"},{"key":"211_CR19","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ipl.2008.07.016","volume":"108","author":"A. Fiedorowicz","year":"2008","unstructured":"A. Fiedorowicz, M. Halszczak, and N. Narayanan, About acyclic edge colourings of planar graphs, Information Processing Letters, 2008, 108: 412\u2013417.","journal-title":"Information Processing Letters"},{"key":"211_CR20","doi-asserted-by":"crossref","unstructured":"M. Borowiecki and A. Fiedorowicz, Acyclic edge coloring of planar graphs without short cycles, Discrete Mathematics, doi: 10.1016\/j.disc.2009.06.007.","DOI":"10.1016\/j.disc.2009.06.007"},{"key":"211_CR21","volume-title":"Some topics restricted coloring problems of graphs","author":"J. Hou","year":"2009","unstructured":"J. Hou, Some topics restricted coloring problems of graphs, phD. Thesis, Shandong University, Jinan, China, 2009."},{"key":"211_CR22","doi-asserted-by":"crossref","unstructured":"J. Hou, J. Wu, G. Liu, and B. Liu, Acyclic edge chromatic number of outerplanar graphs, Journal of Graph Theory, doi: 10.1002\/jgt.20436.","DOI":"10.1002\/jgt.20436"},{"key":"211_CR23","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s00453-001-0093-8","volume":"32","author":"N. Alon","year":"2002","unstructured":"N. Alon and A. Zaks, Algorithmic aspects of acyclic edge colorings, Algorithmica, 2002, 32: 611\u2013614.","journal-title":"Algorithmica"},{"key":"211_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.aml.2007.02.009","volume":"21","author":"X. Zhang","year":"2008","unstructured":"X. Zhang and G. Liu, Some graphs of class 1 for f-colorings, Applied Math. Letters, 2008, 21: 23\u201339.","journal-title":"Applied Math. Letters"},{"key":"211_CR25","first-page":"362","volume":"4489","author":"X. Zhang","year":"2007","unstructured":"X. Zhang and G. Liu, A class of graphs of f-class 1, LNCS, Part III, 2007, 4489: 362\u2013369.","journal-title":"LNCS, Part III"},{"issue":"5","key":"211_CR26","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/s10114-007-6194-9","volume":"24","author":"X. Zhang","year":"2008","unstructured":"X. Zhang and G. Liu, f-Colorings of some graphs of f-class 1, Acta. Math. Sinica, English Serier, 2008, 24(5): 743\u2013746.","journal-title":"Acta. Math. Sinica"},{"key":"211_CR27","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.aml.2005.03.006","volume":"19","author":"X. Zhang","year":"2006","unstructured":"X. Zhang and G. Liu, Some sufficient conditions for a graph to be of C f 1, Applied Mathematics Letters, 2006, 19: 38\u201344.","journal-title":"Applied Mathematics Letters"},{"key":"211_CR28","first-page":"273","volume":"86","author":"X. Zhang","year":"2008","unstructured":"X. Zhang, J. Wang, and G. Liu, The classification of regular graphs on f-colorings, Ars. Combinatoria, 2008, 86: 273\u2013280.","journal-title":"Ars. Combinatoria"},{"key":"211_CR29","volume-title":"f-edge colorings and equitable edge-colorings of graphs","author":"X. Zhang","year":"2007","unstructured":"X. Zhang, f-edge colorings and equitable edge-colorings of graphs, PhD. Thesis, Shandong University, Jinan, China, 2007."},{"issue":"1\u20132","key":"211_CR30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02935792","volume":"19","author":"X. Zhang","year":"2005","unstructured":"X. Zhang and G. Liu, The classification of complete graphs K n on f-coloring, J. Applied Mathematics and Computing, 2005, 19(1\u20132): 127\u2013133.","journal-title":"J. Applied Mathematics and Computing"},{"key":"211_CR31","first-page":"9","volume":"5","author":"V. G. Vizing","year":"1965","unstructured":"V. G. Vizing, Critical graphs with given chromatic class (in Russian), Metody Diskret. Analiz., 1965, 5: 9\u201317.","journal-title":"Metody Diskret. Analiz."},{"issue":"3","key":"211_CR32","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/net.20190","volume":"50","author":"G. Liu","year":"2007","unstructured":"G. Liu, J. Hou, and J. Cai, Some results about f-critical graphs, Networks, 2007, 50(3): 197\u2013202.","journal-title":"Networks"},{"issue":"5","key":"211_CR33","first-page":"910","volume":"48","author":"H. Song","year":"2005","unstructured":"H. Song and G. Liu, On f-edge cover-coloring in multigraphs, Acta Mathematica Sinica, 2005, 48(5): 910\u2013919.","journal-title":"Acta Mathematica Sinica"},{"key":"211_CR34","doi-asserted-by":"crossref","first-page":"6564","DOI":"10.1016\/j.disc.2007.11.049","volume":"308","author":"C. Xu","year":"2008","unstructured":"C. Xu and G. Liu, A note on edge covered chromatic index of multigraphs, Discrete Mathematics, 2008, 308: 6564\u20136568.","journal-title":"Discrete Mathematics"},{"issue":"3","key":"211_CR35","first-page":"101","volume":"4381","author":"G. Liu","year":"2007","unstructured":"G. Liu and C. Xu, Some topics on edge-coloring, LNCS, 2007, 4381(3): 101\u2013108.","journal-title":"LNCS"},{"key":"211_CR36","first-page":"230","volume":"37","author":"G. Liu","year":"1994","unstructured":"G. Liu, On (g, f)-factors and factorizations, Acta Math. Sinica, 1994, 37: 230\u2013237.","journal-title":"Acta Math. Sinica"},{"key":"211_CR37","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s12190-008-0094-8","volume":"28","author":"C. Xu","year":"2008","unstructured":"C. Xu and G. Liu, A note on the (g, f)-coloring, J. Appl. Math. Comput., 2008, 28: 199\u2013205.","journal-title":"J. Appl. Math. Comput."},{"key":"211_CR38","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0012-365X(94)90112-0","volume":"128","author":"A. J. W. Hilton","year":"1994","unstructured":"A. J. W. Hilton and D. de Werra, A sufficient condition for equitable edge-coloring of simple graphs, Discrete Math., 1994, 128: 179\u2013201.","journal-title":"Discrete Math."},{"issue":"4","key":"211_CR39","first-page":"955","volume":"50","author":"C. Xu","year":"2007","unstructured":"C. Xu and G. Liu, On equitable edge-coloring in multigraphs, Acta Math. Sinica, Chinese Series, 2007, 50(4): 955\u2013960.","journal-title":"Acta Math. Sinica, Chinese Series"},{"key":"211_CR40","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/j.disc.2007.07.052","volume":"308","author":"A. J. W. Hilton","year":"2008","unstructured":"A. J. W. Hilton, (r, r + 1)-factorizations of (d, d + 1)-graphs, Dscrete Math., 2008, 308: 645\u2013669.","journal-title":"Dscrete Math."},{"key":"211_CR41","volume-title":"Problems and conjectures in extremal graph theory","author":"A. J. Harris","year":"1984","unstructured":"A. J. Harris, Problems and conjectures in extremal graph theory, Ph. D. dissertation, Cambridge University, UK, 1984."},{"key":"211_CR42","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1112\/jlms\/s2-12.1.123","volume":"12","author":"A. J. W. Hilton","year":"1975","unstructured":"A. J. W. Hilton, Coloring the edges of a multigraph so that each vertex has at most j, or at least j edges of each color on it, J. London Math. Soc., 1975, 12: 123\u2013128.","journal-title":"J. London Math. Soc."},{"key":"211_CR43","volume-title":"Graph Coloring Problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley-Interscience, New York, 1995."},{"key":"211_CR44","first-page":"20","volume":"13","author":"A. Kotzig","year":"1963","unstructured":"A. Kotzig, From the theory of Euler\u2019s polyhedra, Mat. Cas., 1963, 13: 20\u201334.","journal-title":"Mat. Cas."},{"issue":"2","key":"211_CR45","first-page":"187","volume":"15","author":"L. Miao","year":"2002","unstructured":"L. Miao and G. Liu, A edge cover coloring and fractional edge cover coloring, Journal of Systems Science and Complexing, 2002, 15(2): 187\u2013193.","journal-title":"Journal of Systems Science and Complexing"},{"issue":"4","key":"211_CR46","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1002\/jgt.20134","volume":"B51","author":"M. Montassier","year":"2006","unstructured":"M. Montassier, P. Ochem, and A. Raspaud, On the acyclic choosability of graphs, J. Graph Theory, 2006, B51(4): 281\u2013300.","journal-title":"J. Graph Theory"},{"key":"211_CR47","first-page":"96","volume":"33","author":"H. Song","year":"2004","unstructured":"H. Song and G. Liu, Some properties of edge cover critical graphs, Advances in Mathematics, 2004, 33: 96\u2013102.","journal-title":"Advances in Mathematics"},{"key":"211_CR48","first-page":"3","volume":"R-3","author":"D. Werra de.","year":"1971","unstructured":"D. de. Werra, Equitable colorations of graphs, Revue Francaise d\u2019Informatigue et Recherche Operationelle, 1971, R-3: 3\u20138.","journal-title":"Revue Francaise d\u2019Informatigue et Recherche Operationelle"},{"key":"211_CR49","first-page":"6564","volume":"308","author":"D. Wrra de.","year":"2009","unstructured":"D. de. Wrra, Equitable cover-coloring in multigraphs, Discrete Mathematics Algorithms and Applications, 2009, 308: 6564\u20136568.","journal-title":"Discrete Mathematics Algorithms and Applications"},{"key":"211_CR50","doi-asserted-by":"crossref","first-page":"6348","DOI":"10.1016\/j.disc.2007.12.003","volume":"308","author":"C. Xu","year":"2008","unstructured":"C. Xu and G. Liu, Edge covered critical multigraphs, Discrete Mathematics, 2008, 308: 6348\u20136354.","journal-title":"Discrete Mathematics"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-0211-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-010-0211-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-010-0211-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:53:59Z","timestamp":1559386439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-010-0211-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":50,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["211"],"URL":"https:\/\/doi.org\/10.1007\/s11424-010-0211-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}