%0 Journal Article
%T THE NUMBER OF REMOVABLE EDGES IN PLANAR 3-CONNECTED GRAPHS<br>3连通平面图的可去边数
%A Jian Ping OU
%A Jian Ji SU
%A <br>欧见平
%A 苏健基
%J 系统科学与数学
%D 2003
%I 
%X An edge e of a 3-connected graph G is said to be removable if G - e is a subdivision of some 3-connected graph. Let v denote the order of G. It is proved in this paper that there are at least (v+4)/2 removable edges in planar 3-connected graphs with v > 6 . The lower bound is reachable.
%K Planar 3-connected graph
%K removable edge
%K maximal semiwheel<br>3连通平面图
%K 可去边数
%K 极大半轮
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=0E1575BA0868D25E&yid=D43C4A19B2EE3C0A&vid=EA389574707BDED3&iid=38B194292C032A66&sid=A53D7AA35F9929AF&eid=BFB86B6ED3A99B9D&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=6