๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On T-chromatic uniqueness of graphs

โœ Scribed by Zhi-Yi Guo

Book ID
108316094
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
335 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Chromatically unique graphs
Chromatically unique graphs
โœ Chong-Yun Chao; Earl Glen Whitehead Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 493 KB
On path-chromatically unique graphs
On path-chromatically unique graphs
โœ Esperanza Blancaflor Arugay; Severino Villanueva Gervacio ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 230 KB

The least number of colors needed to color the vertices of a graph G such that the vertices in each color class induces a linear forest is called the path-chromatic number of G, denoted by Zoo (G). If all such colorings of the vertices of G induce the same partitioning of the vertices of G, we say

On chromatic uniqueness of uniform subdi
On chromatic uniqueness of uniform subdivisions of graphs
โœ C.P. Teo; K.M. Koh ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

Let u,(G) denote the number of cycles of length k in a graph G. In this paper, we first prove that if G and H are X-equivalent graphs, then ak(G) = a,(H) for all k with g < k < $g -2, where g is the girth of G. This result will then be incorporated with a structural theorem obtained in [7] to show t

On the join of graphs and chromatic uniq
On the join of graphs and chromatic uniqueness
โœ G. L. Chia ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 519 KB

## Abstract A graph is chromatically unique if it is uniquely determined by its chromatic polynomial. Let __G__ be a chromatically unique graph and let __K__~__m__~ denote the complete graph on __m__ vertices. This paper is mainly concerned with the chromaticity of __K__~__m__~ + __G__ where + deno