%0 Journal Article
%T LONGEST CYCLES IN 2-CONNECTED BIPARTITE GRAPHS<br>二连通的二部图的最长圈
%A DANG KAI-QIAN
%A <br>党恺谦
%J 系统科学与数学
%D 1989
%I 
%X 本文研究的图 G 为简单的无向的二部图.所用术语和符号除说明外皆同1].c(G)表示 G 的最长圈的长.以(A_1,A_2)为二分类的二部图记为 G(A_1,A_2).(?)=min{d(v)|v∈V(G)}.已有结果:定理1.设 G(A_1,A_2)为二连通的二部图,则 c(G)≥2min{|A_1|,|A_2|,2δ—2}.定理2.设 G(A_1,A_2)为二连通的二部图,且(?)_i=min{d(v)|v∈A_i}(i=1,
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=DBC3D6BD9F824D302139FA3D542E61F9&yid=1833A6AA51F779C1&vid=9CF7A0430CBB2DFD&iid=0B39A22176CE99FB&sid=2F56B21F91C9B05B&eid=B344543C2864D684&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0