scholarly journals Beta invariant and chromatic uniqueness of wheels

Author(s):  
Sooyeon Lee ◽  
Haidong Wu
Keyword(s):  
1994 ◽  
Vol 128 (1-3) ◽  
pp. 327-335 ◽  
Author(s):  
C.P. Teo ◽  
K.M. Koh
Keyword(s):  

2021 ◽  
Vol 7 (1) ◽  
pp. 38
Author(s):  
Pavel A. Gein

Let \(P(G, x)\) be a chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are called chromatically equivalent iff \(P(G, x) = H(G, x)\). A graph \(G\) is called chromatically unique if \(G\simeq H\) for every \(H\) chromatically equivalent to \(G\). In this paper, the chromatic uniqueness of complete tripartite graphs \(K(n_1, n_2, n_3)\) is proved for \(n_1 \geqslant n_2 \geqslant n_3 \geqslant 2\) and \(n_1 - n_3 \leqslant 5\).


1996 ◽  
Vol 12 (3) ◽  
pp. 221-230 ◽  
Author(s):  
F. M. Dong ◽  
Y. P. Liu
Keyword(s):  

1997 ◽  
Vol 171 (1-3) ◽  
pp. 169-177 ◽  
Author(s):  
Ru-Ying Liu ◽  
Lian-Chang Zhao

1984 ◽  
Vol 8 (3) ◽  
pp. 355-364 ◽  
Author(s):  
Earl Glen Whitehead ◽  
Lian-Chang Zhao
Keyword(s):  

2017 ◽  
Author(s):  
Nor Suriya Abd Karim ◽  
Roslan Hasni
Keyword(s):  

Author(s):  
Y. H. Peng
Keyword(s):  

AbstractWe establish a characterization of certain trees of polygons similar to that of n-gon-trees given by Chao and Li.


Sign in / Sign up

Export Citation Format

Share Document