%0 Journal Article
%T REMOVABLE EDGES IN 4-CONNECTED GRAPHS AND A STRUCTURE OF 4-CONNECTED GRAPHS<br>4连通图的可去边与4连通图的构造
%A Jian Hua YI
%A <br>尹建华
%J 系统科学与数学
%D 1999
%I 
%X in this paper, we define removable edges in a 4-connected graph and provethat the graph without removable edge is C5 or C6. We also give a structure of 4--connectedgraphs of order n.
%K Connected graph
%K removable edge
%K contractible edge
%K 2-cyclic graph<br>连通图
%K 可去边
%K 收缩边
%K 2循环图
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=0E405068EE71E706357502B698F0F379&yid=B914830F5B1D1078&vid=2A8D03AD8076A2E3&iid=E158A972A605785F&sid=E57FE519484CFB70&eid=BEE722AB5028E81F&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=2&reference_num=0