LEADER 03506nam 22006135 450 001 9910299784103321 005 20251116135544.0 010 $a3-319-20394-0 024 7 $a10.1007/978-3-319-20394-2 035 $a(CKB)3710000000463320 035 $a(EBL)3563293 035 $a(SSID)ssj0001546682 035 $a(PQKBManifestationID)16141175 035 $a(PQKBTitleCode)TC0001546682 035 $a(PQKBWorkID)14796101 035 $a(PQKB)11619623 035 $a(DE-He213)978-3-319-20394-2 035 $a(MiAaPQ)EBC3563293 035 $a(PPN)188458395 035 $a(EXLCZ)993710000000463320 100 $a20150810d2015 u| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aColor-induced graph colorings /$fby Ping Zhang 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (130 p.) 225 1 $aSpringerBriefs in Mathematics,$x2191-8198 300 $aDescription based upon print version of record. 311 08$a3-319-20393-2 320 $aIncludes bibliographical references and index. 327 $a1. Introduction -- 2. The Irregularity Strength of a Graph -- 3. Modular Sum-Defined Irregular Colorings -- 4. Set-Defined Irregular Colorings -- 5. Multiset-Defined Irregular Colorings -- 6. Sum-Defined Neighbor-Distinguishing Colorings -- 7. Modular Sum-Defined Neighbor-Distinguishing Colorings -- 8. Strong Edge Colorings of Graphs -- 9. Sum-Defined Chromatic Indices -- References -- Index. 330 $aA comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing vertex colorings induced by edge colorings. The coloring concepts described in this book depend not only on the property required of the initial edge coloring and the kind of objects serving as colors, but also on the property demanded of the vertex coloring produced. For each edge coloring introduced, background for the concept is provided, followed by a presentation of results and open questions dealing with this topic. While the edge colorings discussed can be either proper or unrestricted, the resulting vertex colorings are either proper colorings or rainbow colorings. This gives rise to a discussion of irregular colorings, strong colorings, modular colorings, edge-graceful colorings, twin edge colorings and binomial colorings. Since many of the concepts described in this book are relatively recent, the audience for this book is primarily mathematicians interested in learning some new areas of graph colorings as well as researchers and graduate students in the mathematics community, especially the graph theory community. 410 0$aSpringerBriefs in Mathematics,$x2191-8198 606 $aGraph theory 606 $aCombinatorial analysis 606 $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aGraph theory. 615 0$aCombinatorial analysis. 615 14$aGraph Theory. 615 24$aCombinatorics. 676 $a511.56 700 $aZhang$b Ping$4aut$4http://id.loc.gov/vocabulary/relators/aut$0477502 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910299784103321 996 $aColor-Induced Graph Colorings$92440564 997 $aUNINA