%0 Journal Article
%T MAXIMUM GENUS AND CHROMATIC NUMBER OF GRAPHS<br>图的最大亏格与图的着色数
%A Yuan Qiu HUANG
%A <br>黄元秋
%A 刘彦佩
%J 系统科学与数学
%D 2002
%I 
%X Abstract Combined with the edge-connectivity of graphs, this paper gives an upperbound of Betti deficiency on a graph in terms of chromatic number of its complement, provesthat this bound is the best possible, and obtains some new results on the lower bounds of themaximum genus of graphs.
%K Graphs
%K maximum genus
%K Betti deficiency
%K chromatic number<br>图
%K 最大亏格
%K 亏数
%K 着色数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=302B83C611698473&yid=C3ACC247184A22C1&vid=BC12EA701C895178&iid=0B39A22176CE99FB&sid=EB552E4CFC85690B&eid=0B4F496D54044D86&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=15