top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Autore Dong F. M. <1962->
Pubbl/distr/stampa New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Descrizione fisica 1 online resource (386 p.)
Disciplina 511/.56
Altri autori (Persone) KohK. M <1944-> (Khee Meng)
TeoK. L
Soggetto topico Graph coloring
Graph theory
Polynomials
Soggetto genere / forma Electronic books.
ISBN 1-281-88109-0
9786611881092
981-256-946-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Basic Concepts in Graph Theory; Notation; Chapter 1 The Number of -Colourings and Its Enumerations; Chapter 2 Chromatic Polynomials; Chapter 3 Chromatic Equivalence of Graphs; Chapter 4 Chromaticity of Multi-Partite Graphs; Chapter 5 Chromaticity of Subdivisions of Graphs; Chapter 6 Graphs in Which any Two Colour Classes Induce a Tree (I); Chapter 7 Graphs in Which any Two Colour Classes Induce a Tree (II); Chapter 8 Graphs in Which All but One Pair of Colour Classes Induce Trees (I); Chapter 9 Graphs in Which All but One Pair of Colour Classes Induce Trees (II)
Chapter 10 Chromaticity of Extremal 3-Colourable GraphsChapter 11 Polynomials Related to Chromatic Polynomials; Chapter 12 Real Roots of Chromatic Polynomials; Chapter 13 Integral Roots of Chromatic Polynomials; Chapter 14 Complex Roots of Chromatic Polynomials; Chapter 15 Inequalities on Chromatic Polynomials; Bibliography; Index
Record Nr. UNINA-9910450446303321
Dong F. M. <1962->  
New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Autore Dong F. M. <1962->
Pubbl/distr/stampa New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Descrizione fisica 1 online resource (386 p.)
Disciplina 511/.56
Altri autori (Persone) KohK. M <1944-> (Khee Meng)
TeoK. L
Soggetto topico Graph coloring
Graph theory
Polynomials
ISBN 1-281-88109-0
9786611881092
981-256-946-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Basic Concepts in Graph Theory; Notation; Chapter 1 The Number of -Colourings and Its Enumerations; Chapter 2 Chromatic Polynomials; Chapter 3 Chromatic Equivalence of Graphs; Chapter 4 Chromaticity of Multi-Partite Graphs; Chapter 5 Chromaticity of Subdivisions of Graphs; Chapter 6 Graphs in Which any Two Colour Classes Induce a Tree (I); Chapter 7 Graphs in Which any Two Colour Classes Induce a Tree (II); Chapter 8 Graphs in Which All but One Pair of Colour Classes Induce Trees (I); Chapter 9 Graphs in Which All but One Pair of Colour Classes Induce Trees (II)
Chapter 10 Chromaticity of Extremal 3-Colourable GraphsChapter 11 Polynomials Related to Chromatic Polynomials; Chapter 12 Real Roots of Chromatic Polynomials; Chapter 13 Integral Roots of Chromatic Polynomials; Chapter 14 Complex Roots of Chromatic Polynomials; Chapter 15 Inequalities on Chromatic Polynomials; Bibliography; Index
Record Nr. UNINA-9910783724303321
Dong F. M. <1962->  
New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Chromatic polynomials and chromaticity of graphs [[electronic resource] /] / F.M. Dong, K.M. Koh and K.L. Teo
Autore Dong F. M. <1962->
Edizione [1st ed.]
Pubbl/distr/stampa New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Descrizione fisica 1 online resource (386 p.)
Disciplina 511/.56
Altri autori (Persone) KohK. M <1944-> (Khee Meng)
TeoK. L
Soggetto topico Graph coloring
Graph theory
Polynomials
ISBN 1-281-88109-0
9786611881092
981-256-946-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Preface; Contents; Basic Concepts in Graph Theory; Notation; Chapter 1 The Number of -Colourings and Its Enumerations; Chapter 2 Chromatic Polynomials; Chapter 3 Chromatic Equivalence of Graphs; Chapter 4 Chromaticity of Multi-Partite Graphs; Chapter 5 Chromaticity of Subdivisions of Graphs; Chapter 6 Graphs in Which any Two Colour Classes Induce a Tree (I); Chapter 7 Graphs in Which any Two Colour Classes Induce a Tree (II); Chapter 8 Graphs in Which All but One Pair of Colour Classes Induce Trees (I); Chapter 9 Graphs in Which All but One Pair of Colour Classes Induce Trees (II)
Chapter 10 Chromaticity of Extremal 3-Colourable GraphsChapter 11 Polynomials Related to Chromatic Polynomials; Chapter 12 Real Roots of Chromatic Polynomials; Chapter 13 Integral Roots of Chromatic Polynomials; Chapter 14 Complex Roots of Chromatic Polynomials; Chapter 15 Inequalities on Chromatic Polynomials; Bibliography; Index
Record Nr. UNINA-9910819961103321
Dong F. M. <1962->  
New Jersey ; ; Hong Kong, : World Scientific Pub., 2005
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Autore Jensen Tommy R.
Pubbl/distr/stampa New York, New York : , : John Wiley & Sons, Inc., , 1995
Descrizione fisica 1 online resource (324 p.)
Disciplina 511.5
511/.5
Collana Wiley-Interscience Series in Discrete Mathematics and Optimization
Soggetto topico Graph coloring
Soggetto genere / forma Electronic books.
ISBN 1-283-33198-5
9786613331984
1-118-03249-7
1-118-03074-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Coloring Problems; Contents; Preface; 1 Introduction to Graph Coloring; 1.1 Basic Definitions; 1.2 Graphs on Surfaces; 1.3 Vertex Degrees and Colorings; 1.4 Criticality and Complexity; 16.14 Partition Problem of Galvin and Hajnal; 1.5 Sparse Graphs and Random Graphs; 1.6 Perfect Graphs; 1.7 Edge-Coloring; 1.8 Orientations and Integer Flows; 1.9 List Coloring; 1.10 Generalized Graph Coloring; 1.11 Final Remarks; Bibliography; 2 Planar Graphs; 2.1 Four-Color Theorem; 2.2 Cartesian Sequences; 2.3 Intersection Graphs of Planar Segments; 2.4 Ringerl's Earth-Moon Problem
2.5 Ore and Plummer's Cyclic Chromatic Number2.6 Vertex Partitionings w.r.t. Coloring Number; 2.7 Vertex Partitionings w.r.t. Maximum Degree; 2.8 The Three-Color Problem; 2.9 Steinberg's Three-Color Problem; 2.10 Grünbaum and Havel's Three-Color Problem; 2.11 Grötzsch and Sachs' Three-Color Problem; 2.12 Barnette's Conjecture; 2.13 List-Coloring Planar Graphs; 2.14 Kronk and Mitchem's Entire Chromatic Number; 2.15 Nine-Color Conjecture; 2.16 Uniquely Colorable Graphs; 2.17 Density of 4-Critical Planar Graphs; 2.18 Square of Planar Graphs; Bibliography; 3 Graphs on Higher Surfaces
3.1 Heawood's Empire Problem3.2 Grünbaum's 3-Edge-Color Conjecture; 3.3 Albertson's Four-Color Problem; 3.4 Improper Colorings; 3.5 Number of 6-Critical Graphs on a Surface; 3.6 Toroidal Polyhedra; 3.7 Polynomial Coloring of Embedded Graphs; 3.8 Sparse Embedded Graphs; 3.9 Ringel's 1-Chromatic Number; 3.10 Borodin's Conjecture on Diagonal Coloring; 3.11 Acyclic Colorings; 3.12 Cochromatic Numbers; 3.13 Graphs on Pseudo-Surfaces; Bibliography; 4 Degrees; 4.1 The Coloring Number; 4.2 Coloring of Decomposable Graphs; 4.3 Color-Bound Families of Graphs; 4.4 Edge-Disjoint Placements
4.5 Powers of Hamilton Cycles4.6 Brooks' Theorem for Triangle-Free Graphs; 4.7 Graphs Without Large Complete Subgraphs; 4.8 k-Chromatic Graphs of Maximum Degree k; 4.9 Total Coloring; 4.10 Equitable Coloring; 4.11 Acyclic Coloring; 4.12 Melnikov's Valency-Variety Problem; 4.13 Induced-Odd Degree Subgraphs; 4.14 Strong Chromatic Number; Bibliography; 5 Critical Graphs; 5.1 Critical Graphs With Many Edges; 5.2 Minimum Degree of 4- and 5-Critical Graphs; 5.3 Critical Graphs With Few Edges; 5.4 Four-Critical Amenable Graphs; 5.5 Four-Critical Degree 5 Problem
5.6 Large Critical Subgraphs of Critical Graphs5.7 Critical Subgraph Covering a 2-Path; 5.8 Noninduced Critical Subgraphs; 5.9 Number of Critical Subgraphs; 5.10 Subgraphs of Critical Graphs; 5.11 Minimal Circumference of Critical Graphs; 5.12 The Erdös-Lovász Tihany Problem; 5.13 Partial Joins of Critical Graphs; 5.14 Vertex-Critical Graphs Without Critical Edges; Bibliography; 6 The Conjectures of Hadwiger and Hajós; 6.1 Hadwiger's Conjecture; 6.2 Hajós' Conjecture; 6.3 The (m, n)- and [m, n]-Conjectures; 6.4 Hadwiger Degree of a Graph; 6.5 Graphs Without Odd-K5; 6.6 Scheme Conjecture
6.7 Chromatic 4-Schemes
Record Nr. UNINA-9910141196003321
Jensen Tommy R.  
New York, New York : , : John Wiley & Sons, Inc., , 1995
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Autore Jensen Tommy R.
Pubbl/distr/stampa New York, New York : , : John Wiley & Sons, Inc., , 1995
Descrizione fisica 1 online resource (324 p.)
Disciplina 511.5
511/.5
Collana Wiley-Interscience Series in Discrete Mathematics and Optimization
Soggetto topico Graph coloring
ISBN 1-283-33198-5
9786613331984
1-118-03249-7
1-118-03074-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Coloring Problems; Contents; Preface; 1 Introduction to Graph Coloring; 1.1 Basic Definitions; 1.2 Graphs on Surfaces; 1.3 Vertex Degrees and Colorings; 1.4 Criticality and Complexity; 16.14 Partition Problem of Galvin and Hajnal; 1.5 Sparse Graphs and Random Graphs; 1.6 Perfect Graphs; 1.7 Edge-Coloring; 1.8 Orientations and Integer Flows; 1.9 List Coloring; 1.10 Generalized Graph Coloring; 1.11 Final Remarks; Bibliography; 2 Planar Graphs; 2.1 Four-Color Theorem; 2.2 Cartesian Sequences; 2.3 Intersection Graphs of Planar Segments; 2.4 Ringerl's Earth-Moon Problem
2.5 Ore and Plummer's Cyclic Chromatic Number2.6 Vertex Partitionings w.r.t. Coloring Number; 2.7 Vertex Partitionings w.r.t. Maximum Degree; 2.8 The Three-Color Problem; 2.9 Steinberg's Three-Color Problem; 2.10 Grünbaum and Havel's Three-Color Problem; 2.11 Grötzsch and Sachs' Three-Color Problem; 2.12 Barnette's Conjecture; 2.13 List-Coloring Planar Graphs; 2.14 Kronk and Mitchem's Entire Chromatic Number; 2.15 Nine-Color Conjecture; 2.16 Uniquely Colorable Graphs; 2.17 Density of 4-Critical Planar Graphs; 2.18 Square of Planar Graphs; Bibliography; 3 Graphs on Higher Surfaces
3.1 Heawood's Empire Problem3.2 Grünbaum's 3-Edge-Color Conjecture; 3.3 Albertson's Four-Color Problem; 3.4 Improper Colorings; 3.5 Number of 6-Critical Graphs on a Surface; 3.6 Toroidal Polyhedra; 3.7 Polynomial Coloring of Embedded Graphs; 3.8 Sparse Embedded Graphs; 3.9 Ringel's 1-Chromatic Number; 3.10 Borodin's Conjecture on Diagonal Coloring; 3.11 Acyclic Colorings; 3.12 Cochromatic Numbers; 3.13 Graphs on Pseudo-Surfaces; Bibliography; 4 Degrees; 4.1 The Coloring Number; 4.2 Coloring of Decomposable Graphs; 4.3 Color-Bound Families of Graphs; 4.4 Edge-Disjoint Placements
4.5 Powers of Hamilton Cycles4.6 Brooks' Theorem for Triangle-Free Graphs; 4.7 Graphs Without Large Complete Subgraphs; 4.8 k-Chromatic Graphs of Maximum Degree k; 4.9 Total Coloring; 4.10 Equitable Coloring; 4.11 Acyclic Coloring; 4.12 Melnikov's Valency-Variety Problem; 4.13 Induced-Odd Degree Subgraphs; 4.14 Strong Chromatic Number; Bibliography; 5 Critical Graphs; 5.1 Critical Graphs With Many Edges; 5.2 Minimum Degree of 4- and 5-Critical Graphs; 5.3 Critical Graphs With Few Edges; 5.4 Four-Critical Amenable Graphs; 5.5 Four-Critical Degree 5 Problem
5.6 Large Critical Subgraphs of Critical Graphs5.7 Critical Subgraph Covering a 2-Path; 5.8 Noninduced Critical Subgraphs; 5.9 Number of Critical Subgraphs; 5.10 Subgraphs of Critical Graphs; 5.11 Minimal Circumference of Critical Graphs; 5.12 The Erdös-Lovász Tihany Problem; 5.13 Partial Joins of Critical Graphs; 5.14 Vertex-Critical Graphs Without Critical Edges; Bibliography; 6 The Conjectures of Hadwiger and Hajós; 6.1 Hadwiger's Conjecture; 6.2 Hajós' Conjecture; 6.3 The (m, n)- and [m, n]-Conjectures; 6.4 Hadwiger Degree of a Graph; 6.5 Graphs Without Odd-K5; 6.6 Scheme Conjecture
6.7 Chromatic 4-Schemes
Record Nr. UNISA-996199059103316
Jensen Tommy R.  
New York, New York : , : John Wiley & Sons, Inc., , 1995
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Graph coloring problems / / Tommy R. Jensen, Bjarne Toft
Autore Jensen Tommy R.
Pubbl/distr/stampa New York, New York : , : John Wiley & Sons, Inc., , 1995
Descrizione fisica 1 online resource (324 p.)
Disciplina 511.5
511/.5
Collana Wiley-Interscience Series in Discrete Mathematics and Optimization
Soggetto topico Graph coloring
ISBN 1-283-33198-5
9786613331984
1-118-03249-7
1-118-03074-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Graph Coloring Problems; Contents; Preface; 1 Introduction to Graph Coloring; 1.1 Basic Definitions; 1.2 Graphs on Surfaces; 1.3 Vertex Degrees and Colorings; 1.4 Criticality and Complexity; 16.14 Partition Problem of Galvin and Hajnal; 1.5 Sparse Graphs and Random Graphs; 1.6 Perfect Graphs; 1.7 Edge-Coloring; 1.8 Orientations and Integer Flows; 1.9 List Coloring; 1.10 Generalized Graph Coloring; 1.11 Final Remarks; Bibliography; 2 Planar Graphs; 2.1 Four-Color Theorem; 2.2 Cartesian Sequences; 2.3 Intersection Graphs of Planar Segments; 2.4 Ringerl's Earth-Moon Problem
2.5 Ore and Plummer's Cyclic Chromatic Number2.6 Vertex Partitionings w.r.t. Coloring Number; 2.7 Vertex Partitionings w.r.t. Maximum Degree; 2.8 The Three-Color Problem; 2.9 Steinberg's Three-Color Problem; 2.10 Grünbaum and Havel's Three-Color Problem; 2.11 Grötzsch and Sachs' Three-Color Problem; 2.12 Barnette's Conjecture; 2.13 List-Coloring Planar Graphs; 2.14 Kronk and Mitchem's Entire Chromatic Number; 2.15 Nine-Color Conjecture; 2.16 Uniquely Colorable Graphs; 2.17 Density of 4-Critical Planar Graphs; 2.18 Square of Planar Graphs; Bibliography; 3 Graphs on Higher Surfaces
3.1 Heawood's Empire Problem3.2 Grünbaum's 3-Edge-Color Conjecture; 3.3 Albertson's Four-Color Problem; 3.4 Improper Colorings; 3.5 Number of 6-Critical Graphs on a Surface; 3.6 Toroidal Polyhedra; 3.7 Polynomial Coloring of Embedded Graphs; 3.8 Sparse Embedded Graphs; 3.9 Ringel's 1-Chromatic Number; 3.10 Borodin's Conjecture on Diagonal Coloring; 3.11 Acyclic Colorings; 3.12 Cochromatic Numbers; 3.13 Graphs on Pseudo-Surfaces; Bibliography; 4 Degrees; 4.1 The Coloring Number; 4.2 Coloring of Decomposable Graphs; 4.3 Color-Bound Families of Graphs; 4.4 Edge-Disjoint Placements
4.5 Powers of Hamilton Cycles4.6 Brooks' Theorem for Triangle-Free Graphs; 4.7 Graphs Without Large Complete Subgraphs; 4.8 k-Chromatic Graphs of Maximum Degree k; 4.9 Total Coloring; 4.10 Equitable Coloring; 4.11 Acyclic Coloring; 4.12 Melnikov's Valency-Variety Problem; 4.13 Induced-Odd Degree Subgraphs; 4.14 Strong Chromatic Number; Bibliography; 5 Critical Graphs; 5.1 Critical Graphs With Many Edges; 5.2 Minimum Degree of 4- and 5-Critical Graphs; 5.3 Critical Graphs With Few Edges; 5.4 Four-Critical Amenable Graphs; 5.5 Four-Critical Degree 5 Problem
5.6 Large Critical Subgraphs of Critical Graphs5.7 Critical Subgraph Covering a 2-Path; 5.8 Noninduced Critical Subgraphs; 5.9 Number of Critical Subgraphs; 5.10 Subgraphs of Critical Graphs; 5.11 Minimal Circumference of Critical Graphs; 5.12 The Erdös-Lovász Tihany Problem; 5.13 Partial Joins of Critical Graphs; 5.14 Vertex-Critical Graphs Without Critical Edges; Bibliography; 6 The Conjectures of Hadwiger and Hajós; 6.1 Hadwiger's Conjecture; 6.2 Hajós' Conjecture; 6.3 The (m, n)- and [m, n]-Conjectures; 6.4 Hadwiger Degree of a Graph; 6.5 Graphs Without Odd-K5; 6.6 Scheme Conjecture
6.7 Chromatic 4-Schemes
Record Nr. UNINA-9910830671103321
Jensen Tommy R.  
New York, New York : , : John Wiley & Sons, Inc., , 1995
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph colorings / / Marek Kubale, editor
Graph colorings / / Marek Kubale, editor
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , [2004]
Descrizione fisica 1 online resource (224 p.)
Disciplina 511/.5
Collana Contemporary mathematics
Soggetto topico Graph coloring
Soggetto genere / forma Electronic books.
ISBN 0-8218-7942-1
0-8218-5687-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""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""
""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""
""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""
""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 Hajós Construction""
""11.4. D-choosability and Brooks theorem""""11.5. Planar graphs""; ""11.6. Graphs for which X = Xι""; ""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""
""13.4. Orthogonal polygons with holes""
Record Nr. UNINA-9910479920703321
Providence, Rhode Island : , : American Mathematical Society, , [2004]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph colorings / Marek Kubale, editor
Graph colorings / Marek Kubale, editor
Pubbl/distr/stampa Providence, R. I. : American Mathematical Society, c2004
Descrizione fisica xii, 208 p. : ill. ; 26 cm
Disciplina 511.5
Altri autori (Persone) Kubale, Marekauthor
Collana Contemporary mathematics, 0271-4132 ; 352
Soggetto topico Graph coloring
ISBN 0821834584
Classificazione LC QA166.247.O6813
AMS 05C15
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991000465689707536
Providence, R. I. : American Mathematical Society, c2004
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Graph colorings / / Marek Kubale, editor
Graph colorings / / Marek Kubale, editor
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , [2004]
Descrizione fisica 1 online resource (224 p.)
Disciplina 511/.5
Collana Contemporary mathematics
Soggetto topico Graph coloring
ISBN 0-8218-7942-1
0-8218-5687-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""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""
""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""
""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""
""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 Hajós Construction""
""11.4. D-choosability and Brooks theorem""""11.5. Planar graphs""; ""11.6. Graphs for which X = Xι""; ""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""
""13.4. Orthogonal polygons with holes""
Record Nr. UNINA-9910788667003321
Providence, Rhode Island : , : American Mathematical Society, , [2004]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Graph colorings / / Marek Kubale, editor
Graph colorings / / Marek Kubale, editor
Pubbl/distr/stampa Providence, Rhode Island : , : American Mathematical Society, , [2004]
Descrizione fisica 1 online resource (224 p.)
Disciplina 511/.5
Collana Contemporary mathematics
Soggetto topico Graph coloring
ISBN 0-8218-7942-1
0-8218-5687-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto ""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""
""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""
""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""
""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 Hajós Construction""
""11.4. D-choosability and Brooks theorem""""11.5. Planar graphs""; ""11.6. Graphs for which X = Xι""; ""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""
""13.4. Orthogonal polygons with holes""
Record Nr. UNINA-9910828846103321
Providence, Rhode Island : , : American Mathematical Society, , [2004]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui