On the chromatic equivalence class of a
โ
G.L. Chia
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 196 KB
Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant