Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

62

DM
2007

77views more DM 2007»

Quadrangularly connected claw-free graphs

15 years 2 months ago

Quadrangularly connected claw-free graphs

Download www.math.wvu.edu

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

Real-time Traffic

DM 2007 |

claim paper

Related Content

» Traceability in Small ClawFree Graphs

» tPerfection Is Always Strong for ClawFree Graphs

» Total Domination and Matching Numbers in ClawFree Graphs

» Graph Coloring with Rejection

Post Info
More Details (n/a)

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)