{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:00:51Z","timestamp":1743087651761,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198526"},{"type":"electronic","value":"9783642198533"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19853-3_17","type":"book-chapter","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T00:31:37Z","timestamp":1303086697000},"page":"118-124","source":"Crossref","is-referenced-by-count":0,"title":["Vertex Distinguishing Total Coloring of Ladder Graphs"],"prefix":"10.1007","author":[{"given":"Shitang","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C","volume":"26","author":"A.C. Burris","year":"1997","unstructured":"Burris, A.C., Schelp, R.H.: Vertex-distinguishing Proper Edge-colorings. J. of Graph Theory\u00a026(2), 3\u201382 (1997)","journal-title":"J. of Graph Theory"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1006\/jctb.1998.1884","volume":"75","author":"C. Bazgan","year":"1999","unstructured":"Bazgan, C., Harkat-Benhamdine, A., Li, H., Wo\u017aniak, M.: On the vertex-distinguishing proper edge-coloring of graph. J. of Combine. Theory, Ser. B\u00a075, 288\u2013301 (1999)","journal-title":"J. of Combine. Theory, Ser. B"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.10076","volume":"42","author":"P.N. Balister","year":"2003","unstructured":"Balister, P.N., Riordan, O.M., Schelp, R.H.: Vertex-distinguishing coloring of graphs. J. of Graph Theory\u00a042, 95\u2013109 (2003)","journal-title":"J. of Graph Theory"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z.F. Zhang","year":"2002","unstructured":"Zhang, Z.F., Liu, L.Z., Wang, J.F.: Adjacent strong edge coloring of graphs. J. Applied Mathematics Letters\u00a015, 623\u2013626 (2002)","journal-title":"J. Applied Mathematics Letters"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H. Hatami","year":"2005","unstructured":"Hatami, H.: \u0394+300 is a bound on the adjacent vertex distinguishing edge chromatic number. J. of Combinatorial Theory\u00a095, 246\u2013256 (2005)","journal-title":"J. of Combinatorial Theory"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"P.N. Balister","year":"2006","unstructured":"Balister, P.N., Gy\u00f6ri, E., Lehel, J., Schelp, P.H.: Adjacent vertex distinguishing edgecolorings. SIAM Journal On Discrete Mathematics\u00a021, 237\u2013250 (2006)","journal-title":"SIAM Journal On Discrete Mathematics"},{"issue":"3","key":"17_CR7","first-page":"703","volume":"49","author":"Z.F. Zhang","year":"2006","unstructured":"Zhang, Z.F., Li, J.W., Chen, X.E., et al.: D(\u03b2) Vertex-distinguishing proper edgecoloring of graphs. Acta Mathematica Sinica, Chinese Series\u00a049(3), 703\u2013708 (2006)","journal-title":"Acta Mathematica Sinica, Chinese Series"},{"issue":"23","key":"17_CR8","doi-asserted-by":"publisher","first-page":"3005","DOI":"10.1016\/j.disc.2004.12.027","volume":"306","author":"S. Akbari","year":"2006","unstructured":"Akbari, S., Bidkhori, H., Nosrati, N.: r-Strong Edge Colorings of Graphs. Discrete Mathematics\u00a0306(23), 3005\u20133010 (2006)","journal-title":"Discrete Mathematics"},{"key":"17_CR9","first-page":"1434","volume":"31","author":"Z. Zhang","year":"1988","unstructured":"Zhang, Z., Zhang, J., Wang, J.: The total chromatic number of some graphs. Sci. China Ser. A\u00a031, 1434\u20131441 (1988)","journal-title":"Sci. China Ser. A"},{"key":"17_CR10","first-page":"90","volume":"21","author":"Z. Zhang","year":"1992","unstructured":"Zhang, Z., Wang, J.: A summary of the progress on total colorings of graphs. Adv. in Math (China)\u00a021, 90\u2013397 (1992)","journal-title":"Adv. in Math. (China)"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1360\/03YS0207","volume":"48","author":"Z. Zhang","year":"2005","unstructured":"Zhang, Z., Chen, X., Li, J., et al.: On adjacent-vertex-distinguishing total coloring of graphs. Sci. China Ser. A\u00a048(3), 289\u2013299 (2005)","journal-title":"Sci. China Ser. A"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10878-006-9038-0","volume":"14","author":"H. Wang","year":"2007","unstructured":"Wang, H.: On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \u0394(G) = 3. Journal of Combinatorial Optimization\u00a014(1), 87\u2013109 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"4003","DOI":"10.1016\/j.disc.2007.07.091","volume":"308","author":"X. Chen","year":"2008","unstructured":"Chen, X.: On the adjacent vertex distinguishing total coloring numbers of graphs with \u0394 = 3. Discrete Mathematics\u00a0308, 4003\u20134007 (2008)","journal-title":"Discrete Mathematics"},{"issue":"8","key":"17_CR14","doi-asserted-by":"publisher","first-page":"2548","DOI":"10.1016\/j.disc.2008.06.002","volume":"309","author":"J. Hulgan","year":"2009","unstructured":"Hulgan, J.: Concise proofs for adjacent vertex-distinguishing total colorings. Discrete Mathematics\u00a0309(8), 2548\u20132550 (2009)","journal-title":"Discrete Mathematics"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"979","DOI":"10.11650\/twjm\/1500404991","volume":"12","author":"W. Wang","year":"2008","unstructured":"Wang, W., Wang, Y.: Adjacent vertex distinguishing total coloring of graphs with lower average degree. Taiwanese J. Math.\u00a012, 979\u2013990 (2008)","journal-title":"Taiwanese J. Math."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Wang, Y., Wang, W.: Adjacent vertex distinguishing total colorings of outerplanar graphs. Journal of Combinatorial Optimization (2008)","DOI":"10.1007\/s10878-008-9165-x"},{"key":"17_CR17","first-page":"33","volume":"87","author":"Z. Zhang","year":"2008","unstructured":"Zhang, Z., Qiu, P., Xu, B., et al.: Vertex-distinguishing total coloring of graphs. Ars Combinatoria.\u00a087, 33\u201345 (2008)","journal-title":"Ars Combinatoria."},{"issue":"10","key":"17_CR18","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1007\/s11425-006-2029-x","volume":"48","author":"Z. Zhang","year":"2006","unstructured":"Zhang, Z., Li, J., Chen, X., et al.: D(\u03b2)-vertex-distinguishing total colorings of graphs. Science in China Series A: Mathematics\u00a048(10), 1430\u20131440 (2006) (in Chinese)","journal-title":"Science in China Series A: Mathematics"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11425-007-0128-y","volume":"51","author":"Z. Zhang","year":"2008","unstructured":"Zhang, Z., Cheng, H., Yao, B., et al.: On The adjacent-vertex-strongly-distinguishing total coloring of graphs. Science in China Series A: Mathematics\u00a051(3), 427\u2013436 (2008)","journal-title":"Science in China Series A: Mathematics"},{"key":"17_CR20","first-page":"33","volume":"87","author":"Z. Zhang","year":"2008","unstructured":"Zhang, Z., Qiu, P., Xu, B., et al.: Vertex distinguishing total coloring of graphs. Ars Combinatoria\u00a087, 33\u201345 (2008)","journal-title":"Ars Combinatoria"},{"key":"17_CR21","volume-title":"Graphs and Diagraphs","author":"G. Chartrand","year":"1986","unstructured":"Chartrand, G., Linda, L.F.: Graphs and Diagraphs, 2nd edn. Wadswirth Brooks\/Cole, Monterey, CA (1986)","edition":"2"},{"key":"17_CR22","doi-asserted-by":"crossref","DOI":"10.1090\/crmp\/023","volume-title":"Graph coloring and application","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Marcotte, O.: Graph coloring and application. AMS providence, Rhode Island USA (1999)"},{"key":"17_CR23","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Person Education, Inc., Prentice Hall (2006)"}],"container-title":["Communications in Computer and Information Science","Information and Automation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19853-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T23:34:29Z","timestamp":1560123269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19853-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198526","9783642198533"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19853-3_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}