An Algorithm for Colouring of Halin Graphs
Received:January 12, 2000  
Key Words: Halin graph   odd wheel   even wheel   fan.  
Fund Project:
Author NameAffiliation
XIAO Li Dept. of Comp. Sci.
Zhongshan University
Guangzhou
China 
LOU Ding-jun Dept. of Comp. Sci.
Zhongshan University
Guangzhou
China 
Hits: 2294
Download times: 1172
Abstract:
      In this paper, we determine the vertex chromatic number of Halin graphs, and then give a linear time algorithm for colouring of Halin graphs.
Citation:
DOI:10.3770/j.issn:1000-341X.2003.03.026
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.