Minimum Coverings of Complete Directed Graphs with Odd Size Circuits
Received:June 21, 1999  
Key Words: m-circuits   covering number   complete directed graph.  
Fund Project:Supported by NSFHB (197173 and 101092)
Author NameAffiliation
LIANG Zhi-he Dept. of Math.
Hebei Normal University
Shijiazhuang
China 
Hits: 2475
Download times: 1133
Abstract:
      
Citation:
DOI:10.3770/j.issn:1000-341X.2002.03.013
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.