LEADER 04627nam 2200601 450 001 9910828846103321 005 20170924212545.0 010 $a0-8218-7942-1 010 $a0-8218-5687-1 035 $a(CKB)3240000000069878 035 $a(EBL)3113429 035 $a(SSID)ssj0001339193 035 $a(PQKBManifestationID)11761155 035 $a(PQKBTitleCode)TC0001339193 035 $a(PQKBWorkID)11351852 035 $a(PQKB)10348484 035 $a(MiAaPQ)EBC3113429 035 $a(WaSeSS)Ind00039435 035 $a(RPAM)13511640 035 $a(PPN)19710679X 035 $a(EXLCZ)993240000000069878 100 $a20040304h20042004 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGraph colorings /$fMarek Kubale, editor 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[2004] 210 4$d©2004 215 $a1 online resource (224 p.) 225 1 $aContemporary mathematics,$x0271-4132 ;$v352 300 $aDescription based upon print version of record. 311 $a0-8218-3458-4 320 $aIncludes bibliographical references (pages 189-201) and index. 327 $a""Contents""; ""Preface""; ""Graph coloring""; ""History of graph coloring""; ""Models of graph coloring""; ""Preface to the English Edition""; ""Chapter 1. Classical Coloring of Graphs""; ""1.1. Basic terms and definitions""; ""1.2. Classical vertex-coloring""; ""1.3. Classical edge-coloring""; ""Chapter 2. On-line Coloring of Graphs""; ""2.1. On-line and off-line coloring""; ""2.2. On-line coloring algorithms""; ""2.3. Worst case effectiveness of on-line coloring""; ""2.4. Expected effectiveness of on-line coloring""; ""2.5. Susceptibility of graphs"" 327 $a""2.6. Coloring of intersection graphs""""2.7. Applications to resource management""; ""Chapter 3. Equitable Coloring of Graphs""; ""3.1. Equitable vertex-coloring""; ""3.2. Equitable total coloring""; ""Chapter 4. Sum Coloring of Graphs""; ""4.1. Definition and simple properties""; ""4.2. The complexity of the sum coloring problem""; ""4.3. Generalizations of the sum coloring problem""; ""4.4. Some applications of the sum coloring problem""; ""Chapter 5. T-Coloring of Graphs""; ""5.1. The spans""; ""5.2. Sets of forbidden distances""; ""5.3. T-colorings of graphs"" 327 $a""5.4. T-spans and T-chromatic numbers""""5.5. Homomorphisms and T-graphs""; ""5.6. Estimates and exact values""; ""5.7. The computational complexity""; ""5.8. Approximation algorithms""; ""5.9. Applications""; ""Chapter 6. Rank Coloring of Graphs""; ""6.1. Vertex ranking""; ""6.2. Edge ranking""; ""Chapter 7. Harmonious Coloring of Graphs""; ""7.1. Introduction""; ""7.2. Graphs with known harmonious number""; ""7.3. Bounds for the harmonious chromatic number of general graphs""; ""7.4. Algorithm Depressive""; ""7.5. Applications""; ""Chapter 8. Interval Edge-Coloring of Graphs"" 327 $a""8.1. Basic properties of the model""""8.2. Consecutively colorable bipartite graphs""; ""8.3. The span of interval coloring""; ""8.4. Deficiency of graphs""; ""Chapter 9. Circular Coloring of Graphs""; ""9.1. Circular coloring of the vertices of a graph""; ""9.2. Circular coloring of the edges of a graph""; ""Chapter 10. Path Coloring and Routing in Graphs""; ""10.1. Basic definitions""; ""10.2. Known results""; ""10.3. Applications""; ""Chapter 11. List Colorings of Graphs""; ""11.1. Notation and definitions""; ""11.2. Bipartite and 2-choosable graphs""; ""11.3. The HajA?³s Construction"" 327 $a""11.4. D-choosability and Brooks theorem""""11.5. Planar graphs""; ""11.6. Graphs for which X = XI?¹""; ""11.7. (k, r)-choosability""; ""11.8. Edge-list coloring""; ""Chapter 12. Ramsey Colorings of Complete Graphs""; ""12.1. Notation and basic definitions""; ""12.2. Ramsey numbers""; ""12.3. Values and properties of classical Ramsey numbers""; ""12.4. Nonclassical Ramsey numbers""; ""12.5. Applications of Ramsey numbers""; ""Chapter 13. Placing Guards in Art Galleries by Graph Coloring""; ""13.1. Introduction""; ""13.2. Fisk's proof""; ""13.3. The orthogonal art gallery theorem"" 327 $a""13.4. Orthogonal polygons with holes"" 410 0$aContemporary mathematics (American Mathematical Society) ;$vv. 352. 606 $aGraph coloring 615 0$aGraph coloring. 676 $a511/.5 702 $aKubale$b Marek$f1946- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828846103321 996 $aOptymalizacja dyskretna$955384 997 $aUNINA