| 查看: 2414 | 回复: 7 | ||
| 当前只显示满足指定条件的回帖，点击这里查看本话题的所有回帖 | ||
[求助]
请高手帮忙查询下论文是否EI检索,检索号多少，谢谢
|
||
|
题目：Total Colorings of Planar Graphs With Maximum Degree Seven and Without 3-cycles Adjacent to 5-cycles 谢谢 |
回复此楼» 猜你喜欢
售SCI文章，我:8O.5.5.1O.54,科目全,可十急
已经有4人回复
-
售SCI一区T0P文章，我:8.O.55.1.O54,科目全,可伽急
已经有4人回复
-
售SCI一区文章，我:8.O.55.1.O.54,科目齐全,可伽急
已经有4人回复
-
售SCI一区T0P文章，我:8.O.55.1.O.54,科目齐全,可+急
已经有4人回复
-
售SCI-T0P文章，我:8O.5.5.1.O.54,科目齐全,可+急
已经有3人回复
-
售SCI文章，我:8O.5.5.1O.54,科目全,可十急
已经有3人回复
-
售一区SCI文章T0P，我:8O.551.O54,科目全,可十急
已经有3人回复
-
售SCI文章，我:8O5.5.1.O.54,科目齐全,可+急
已经有4人回复
-
售SCI文章，我:8O5.5.1.O.54,科目齐全,可+急
已经有3人回复
-
售SCI一区T0P文章，我:8.O.55.1.O54,科目全,可伽急
已经有3人回复
» 本主题相关价值贴推荐，对您同样有帮助:
- 请高手帮忙查询下论文是否EI检索,检索号多少，谢谢
已经有10人回复
- 被SCI和EI检索的论文从哪里可以下载【求助完结】
已经有10人回复
- 请帮忙查询下2010SOPO的两篇文章是否被Ei检索，谢谢！！
已经有6人回复
5楼2012-03-04 17:30:48
pengwuji18
铁杆木虫 (正式写手)
- 应助: 13 (小学生)
- 金币: 6595.6
- 红花: 4
- 帖子: 996
- 在线: 123.7小时
- 虫号: 1357585
- 注册: 2011-07-31
- 专业: 机械工程
【答案】应助回帖
★
感谢参与，应助指数 +1
imyourkobe(金币+1): 多谢你的帮助 2012-03-04 19:05:13
感谢参与，应助指数 +1
imyourkobe(金币+1): 多谢你的帮助 2012-03-04 19:05:13
|
Accession number: 20120114656129 Title: Total colorings of planar graphs with maximum degree seven and without 3-cycles adjacent to 5-cycles Authors: Liu, Guangde1 ; Wang, Bing1, 2 ; Wu, Jian-Liang2 Author affiliation: 1 Department of Mathematics, Zaozhuang University, Zaozhuang, 277160, China 2 School of Mathematics, Shandong University, Jinan, 250100, China Corresponding author: Liu, G. (lgd@uzz.edu.cn) Source title: Advances in Intelligent and Soft Computing Abbreviated source title: Adv. Intell. Soft Comput. Volume: 122 Monograph title: Foundations of Intelligent Systems: Proceedings of the Sixth International Conference on Intelligent Systems and Knowledge Engineering, Shanghai, China, Dec 2011 (ISKE2011) Issue date: 2011 Publication year: 2011 Pages: 335-342 Language: English ISSN: 18675662 ISBN-13: 9783642256639 Document type: Conference article (CA) Publisher: Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany Abstract: Let G be a planar graph with maximum degree Δ ≥ 7 and without 3-cycles adjacent to 4-cycles, that is, any 3-cycle has not a common edge with a 5-cycle. Then the total chromatic number of G is Δ + 1. © 2011 Springer-Verlag Berlin Heidelberg. Number of references: 12 Main heading: Graph theory Controlled terms: Graphic methods - Intelligent systems - Knowledge engineering Uncontrolled terms: Cycle - Maximum degree - Planar graph - Total chromatic number - Total coloring Classification code: 723.4 Artificial Intelligence - 723.5 Computer Applications - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory DOI: 10.1007/978-3-642-25664-6_39 Database: Compendex |
2楼2012-03-04 12:36:54
3楼2012-03-04 16:36:17
4楼2012-03-04 17:03:47
