%0 Journal Article
%T The Crossing Number of C(m,3)<br>C(m,3)的交叉数
%A Lu Junjie
%A Ren Han
%A Ma Dengju
%A <br>卢俊杰
%A 任韩
%A 马登举
%J 系统科学与数学
%D 2006
%I 
%X It is well known that determination of the exact value of the crossing number for any nontrivial type of graphs is very difficult. This paper shows that for each $k \ge 2$ and $ h \in \{0,1,2\}$ the crossing number is $k+h$ for the circular graph $C(3k+h,3)$, and 1 for $C(m,3)$ with $m{=}5,6,7$.
%K Crossing number
%K drawing
%K circular graph
%K removal number<br>交叉数
%K 画法
%K 循环图
%K 去边数
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=6AEE261D2F88E892&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=E158A972A605785F&sid=9B1D77939DDB4B89&eid=D8AE57480552698F&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=2&reference_num=10