On chromatic number of { 2K1+K2 , C4 }-free graphs

Journal of East China Normal University(Natural Sc ›› 2014, Vol. 2014 ›› Issue (1): 9-12.

• Article • Previous Articles Next Articles

On chromatic number of { 2K₁+K₂ , C₄}-free graphs

DUAN Fang, ZHANG Wei-juan

School of Mathematical Sciences, Xinjiang Normal University,\; Urumqi 830054, China

Received:2013-04-01 Revised:2013-07-01 Online:2014-01-25 Published:2015-09-25

Abstract

CLC Number:

O157.5

DUAN Fang, ZHANG Wei-juan. On chromatic number of { 2K₁+K₂ , C₄}-free graphs[J]. Journal of East China Normal University(Natural Sc, 2014, 2014(1): 9-12.

[1]	CHEN Xiang’en, YANG Weiguang. Vertex-distinguishing E-total coloring of a complete bipartite graph K_{9, n} (93 ≤ n ≤ 216) [J]. Journal of East China Normal University(Natural Science), 2020, 2020(6): 24-29.
[2]	WANG Xiao. The chromatic number for fork-free graphs [J]. Journal of East China Normal University(Natural Sc, 2016, 2016(1): 102-106.
[3]	YANG Fang, WANG Zhi-wen, CHEN Xiang-en, MA Chun-yan. Vertex-distinguishing proper edge coloring of composition of complete graph and star [J]. Journal of East China Normal University(Natural Sc, 2013, 2013(5): 136-143.
[4]	LIU Xin-sheng, LU Wei-hua. An upper bound for the vertex-distinguishing star edge chromatic number of graphs [J]. Journal of East China Normal University(Natural Sc, 2012, 2012(5): 120-126.

On chromatic number of { 2K₁+K₂ , C₄}-free graphs

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Recommended Articles

Metrics

Comments