On the Strong Perfectness of Total Graph
Received:December 05, 1991  
Key Words: graph   total graph   perfect.  
Fund Project:
Author NameAffiliation
Zhang Zhongfu Lanzhou Railway Institute 
Lu Xinzhong Lanzhou Railway Institute 
WangZiguo Northwest Industry University 
Shen Xuejun Hainan Huaxin Group Co.Ltd. 
Hits: 2113
Download times: 1005
Abstract:
      This paper proves that the total graph T(G)is perfect if and only if each block of Ghas at most three vertices,and the strong perfect conjecture is true for any total graph.
Citation:
DOI:10.3770/j.issn:1000-341X.1994.04.033
View Full Text  View/Add Comment