Minimal claw-free graphs

被引：0

作者：

P. Dankelmann

Henda C. Swart

P. van den Berg

W. Goddard

M. D. Plummer

机构：

[1] University of KwaZulu-Natal,

[2] Clemson University,undefined

[3] Vanderbilt University,undefined

来源：

Czechoslovak Mathematical Journal | 2008年 / 58卷

关键词：

minimal claw-free; degree; bow-tie; line graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G ™ e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs.

引用

共 9 条

[1]

Faudree R.(1997)Claw-free graphs—a survey Discrete Math. 164 87-147

[2]

Flandrin E.(1993)A note on Hamilton cycles in claw-free graphs Congr. Numer. 96 113-122

[3]

Ryjáček Z.(1994)Extending matchings in claw-free graphs Discrete Math. 125 301-307

[4]

Plummer M. D.(1997)On a closure concept in claw-free graphs J. Combin. Theory Ser. B 70 217-224

[5]

Plummer M. D.(1976)Minimal line graphs Glasgow Math. J. 17 12-16

[6]

Ryjáček Z.(1965)The interchange graph of a finite graph Acta Math. Acad. Sci. Hungar. 16 263-269

[7]

Sumner D. P.(undefined)undefined undefined undefined undefined-undefined

[8]

van Rooij A. C. M.(undefined)undefined undefined undefined undefined-undefined

[9]

Wilf H. S.(undefined)undefined undefined undefined undefined-undefined

← 1 →