Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph

被引:2
|
作者
Fujita, K [1 ]
机构
[1] Sci Univ Tokyo, Dept Appl Math, Shinjuku Ku, Tokyo 1628601, Japan
关键词
Hamiltonian Cycle; Contractible Edge;
D O I
10.1007/s003730200033
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We show that if G is it 3-connected hamiltonian graph of order at least 5, then there exists a hamiltonian cycle C of G Such that the number of contractible edges of G which are on C is greater than or equal to \V(G)\+9/8.
引用
收藏
页码:447 / 478
页数:32
相关论文
共 50 条