Loading...
Please wait, while we are loading the content...
Distant Vertex Partitions of Graphs
| Content Provider | Scilit |
|---|---|
| Author | Jagger, Chris |
| Copyright Year | 1998 |
| Description | We consider the function $χ(G^{k}$), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for the cases k=2 and k=3. |
| Related Links | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/244E6D01A8376613CCB24C4ECE05217A/S0963548398003654a.pdf/div-class-title-distant-vertex-partitions-of-graphs-div.pdf |
| Ending Page | 422 |
| Page Count | 10 |
| Starting Page | 413 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s0963548398003654 |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 4 |
| Volume Number | 7 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 1998-12-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |