Sciweavers

DM
2007

Quadrangularly connected claw-free graphs

13 years 4 months ago
Quadrangularly connected claw-free graphs
A graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a sequence of l-cycles (3 ≤ l ≤ 4)
MingChu Li, Cheng Guo, Liming Xiong, Dengxin Li, H
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where DM
Authors MingChu Li, Cheng Guo, Liming Xiong, Dengxin Li, Hong-Jian Lai
Comments (0)