Edge-pancyclicity of coupled graphs

被引：8
|
作者：
Lih, KW
Song, ZM
Wang, WF
Zhang, KM
机构：
[1] Acad Sinica, Inst Math, Taipei 11529, Taiwan
[2] SE Univ, Dept Appl Math, Nanjing 210096, Peoples R China
[3] Liaoning Univ, Dept Math, Shenyang 110036, Peoples R China
[4] Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2002年 / 119卷 / 03期
关键词：
coupled graph; edge-panciclicity; ear decomposition;
D O I：
10.1016/S0166-218X(01)00307-9
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The coupled graph c(G) of a plane graph G is the graph defined on the vertex set V(G)boolean ORF(G) so that two vertices in c(G) are joined by an edge if and only if they are adjacent or incident in G. We prove that the coupled graph of a 2-connected plane graph is edge-pancyclic. However, there exists a 2-edge-connected plane graph G such that c(G) is not Hamiltonian. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：259 / 264
页数：6
相关论文
共 50 条
12345