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

Chromatic uniqueness of the complements of certain forests

โœ Scribed by Nian-Zu Li; Xue-Wen Bao; Ru-Ying Liu

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
213 KB
Volume
172
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

A tree is called a tree of T-shape if its degree sequence is (1, 1, 1, 2, 2, ..., 2, 3). In this paper, we prove that the complement of the disjoint union of any number copies of a kind of tree of T-shape is chromatically unique by studying its adjoint polynomial.

๐Ÿ“œ SIMILAR VOLUMES

The chromatic uniqueness of W10
The chromatic uniqueness of W10
โœ Nian-Zu Li; Earl Glen Whitehead Jr ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 165 KB

Li, N.-Z. and E.G. Whitehead Jr, The chromatic uniqueness of W,,, Discrete Mathematics 104 (1992) 197-199. Xu and Li proved the chromatic uniqueness of wheels on an odd number of vertices. It is known that the wheels on six vertices and eight vertices are not chromatically unique. Read found that th

Chromatic uniqueness of the generalized
Chromatic uniqueness of the generalized ฮธ-graph
โœ Beatrice Loerinc ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 323 KB

A generalized O-graph i.~ a wnnected graph with 3 palths between a pair of vertices of degree 3. It is showi:~ that uny graph having the same ckomatic polynomial as a generaiized O-graph, must be isomorphic to tk generalized O-graph.

The chromatic uniqueness of complete bip
The chromatic uniqueness of complete bipartite graphs
โœ Shaoji Xu ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th