Bounds on vertex colorings with restrictions on the union of color classes
β Scribed by N. R. Aravind; C. R. Subramanian
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 197 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let G be a graph with n vertices. The mean color number of G, denoted by (G), is the average number of colors used in all n-colorings of G. This paper proves that (G) ! (Q), where Q is any 2-tree with n vertices and G is any graph whose vertex set has an ordering x 1 ,x 2 , . . . ,x n such that x i
## Abstract A (plane) 4βregular map __G__ is called __C__βsimple if it arises as a superposition of simple closed curves (tangencies are not allowed); in this case Ο (__G__) is the smallest integer __k__ such that the curves of __G__ can be colored with __k__ colors in such a way that no two curves
On p. 272 of the above article, paragraph # 3 is incomplete. It should read as the following: Hence to prove Proposition 4 it is enough to show that the edges of Q 4 can be colored with 4 colors in such a way that each square has one edge of each color. Such a coloring is displayed on the following
## Abstract The purpose of this study was to investigate the effect of cerium and bismuth coloring salts solutions on the microstructure, color, flexural strength, and aging resistance of tetragonal zirconia for dental applications (3YβTZP). Cylindrical blanks were sectioned into disks (2βmm thick,