A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS

Bao Guang XU;Zhen Hong LIU

系统科学与复杂性(英文) ›› 2001, Vol. 14 ›› Issue (1) : 91-092.

PDF(133 KB)
中国科学院数学与系统科学研究院期刊网
JSSC
PDF(133 KB)
系统科学与复杂性(英文) ›› 2001, Vol. 14 ›› Issue (1) : 91-092.
论文

A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS

    Bao Guang XU,Zhen Hong LIU
作者信息 +

A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS

    Bao Guang XU,Zhen Hong LIU
Author information +
文章历史 +

摘要

In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.

Abstract

In this paper it is shown that every connected claw-free graph G contains connected [a, max{a + 2, b}]-factors if it has [a, b]-factors, where a, b are integers and b ≥ a ≥ 1.

关键词

Connected factor / claw-free graph / [f / g]-

Key words

Connected factor / claw-free graph / [f / g]-factor

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
Bao Guang XU , Zhen Hong LIU. A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS. 系统科学与复杂性(英文), 2001, 14(1): 91-092
Bao Guang XU , Zhen Hong LIU. A NOTE ON CONNECTED FACTORS IN CLAW-FREE GRAPHS. Journal of Systems Science and Complexity, 2001, 14(1): 91-092
PDF(133 KB)

132

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉