Injective Coloring of Planar Graphs

ZHU Hai-yang,WANG Shu-ling,LIU Man,LV Xin-zhong

doi:10.13718/j.cnki.xsxb.2017.04.002

Journal of Southwest China Normal University(Natural Science Edition)

Search Advanced

Message Board

Dear readers, authors and reviewers,you can add a message on this page. We will reply to you as soon as possible!

Name
	Name cannot be empty!
E-mail
	Mailbox cannot be empty! Mailbox cannot be empty!
Telephone
	Mobile number cannot be empty! Please enter a valid mobile number!
Title

Content
Verification Code

PDF
Cite
Share

facebook

twitter

google

linkedin

2017 Volume 42 Issue 4

Article Contents

Previous Article Next Article

ZHU Hai-yang,WANG Shu-ling,LIU Man,LV Xin-zhong. Injective Coloring of Planar Graphs[J]. Journal of Southwest China Normal University(Natural Science Edition), 2017, 42(4). doi: 10.13718/j.cnki.xsxb.2017.04.002

Citation:

ZHU Hai-yang,WANG Shu-ling,LIU Man,LV Xin-zhong. Injective Coloring of Planar Graphs[J]. Journal of Southwest China Normal University(Natural Science Edition), 2017, 42(4). doi: 10.13718/j.cnki.xsxb.2017.04.002

Injective Coloring of Planar Graphs

ZHU Hai-yang,WANG Shu-ling,LIU Man,LV Xin-zhong

More Information

Abstract

With Euler′s formula and Discharging Rules, it has been proved that if G be a planar graph with maximum degree Δ(G)≤6 and without 4,5,6,7-cycles, then the upper bound of injective chromatic number of G is Δ(G)+5.
- planar graph；injective coloring；injective chromatic number；cycles,
References
Access History

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

Export Citation

PDF

XML

Article Metrics

Article views(715) PDF downloads(35) Cited by(0)

Access History