%0 Journal Article
%T THE NEIGHBORHOOD HOMOLOGY CLASSIFICATION OF THE C4-FREE GRAPHS<br>无C_4图的邻域同调分类
%A Xue Xiuqian
%A <br>薛秀谦
%J 系统科学与数学
%D 1998
%I 
%X A graph which does not contain a four-cycle is called the C4-free graph.Two graphs are called neighborhood homologous if their neighborhood homology groups areisomorphic. This paper proves that two connected C4-free graphs are neighborhood homologousif and only if they have identical bipartite characters and equal cyclomatic numbers.
%K A C4-free graph
%K neighborhood homology
%K identical bipartite character
%K cyclomatic number<br>无C_4图
%K 邻域同调
%K 二分性相同
%K 圈秩
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=C73C651DA48E6AC9CE85831870BB4C72&yid=8CAA3A429E3EA654&vid=13553B2D12F347E8&iid=CA4FD0336C81A37A&sid=74011071555EB4E5&eid=89F76E117E9BDB76&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0