| ²é¿´: 2121 | »Ø¸´: 7 | |||
zhongguo1haoÒø³æ (³õÈëÎÄ̳)
|
[ÇóÖú]
Çë¸ßÊÖ°ïæ²éѯÏÂÂÛÎÄÊÇ·ñEI¼ìË÷,¼ìË÷ºÅ¶àÉÙ£¬Ð»Ð»
|
|
ÌâÄ¿£ºTotal Colorings of Planar Graphs With Maximum Degree Seven and Without 3-cycles Adjacent to 5-cycles лл |
» ²ÂÄãϲ»¶
289Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
317Çóµ÷¼Á
ÒѾÓÐ10È˻ظ´
¹ãÎ÷´óѧ¼ÒÇÝÒÅ´«ÓýÖÖ¿ÎÌâ×é2026Äê˶ʿÕÐÉú£¨½ÓÊÕ¼ÆËã»úרҵµ÷¼Á£©
ÒѾÓÐ3È˻ظ´
ѧУÒѾÌá½»µ½NSFC£¬»¹ÄÜÐÞ¸ÄÂð£¿
ÒѾÓÐ8È˻ظ´
08¹¤Ñ§µ÷¼Á
ÒѾÓÐ5È˻ظ´
281Çóµ÷¼Á£¨0805£©
ÒѾÓÐ25È˻ظ´
085600²ÄÁÏÓ뻯¹¤
ÒѾÓÐ6È˻ظ´
265Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
0817 »¯Ñ§¹¤³Ì 299·ÖÇóµ÷¼Á ÓпÆÑоÀú ÓжþÇøÎÄÕÂ
ÒѾÓÐ21È˻ظ´
295²ÄÁÏÇóµ÷¼Á£¬Ò»Ö¾Ô¸Î人Àí¹¤085601ר˶
ÒѾÓÐ4È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
Çë¸ßÊÖ°ïæ²éѯÏÂÂÛÎÄÊÇ·ñEI¼ìË÷,¼ìË÷ºÅ¶àÉÙ£¬Ð»Ð»
ÒѾÓÐ10È˻ظ´
±»SCIºÍEI¼ìË÷µÄÂÛÎÄ´ÓÄÄÀï¿ÉÒÔÏÂÔØ¡¾ÇóÖúÍê½á¡¿
ÒѾÓÐ10È˻ظ´
Çë°ïæ²éѯÏÂ2010SOPOµÄÁ½ÆªÎÄÕÂÊÇ·ñ±»Ei¼ìË÷£¬Ð»Ð»£¡£¡
ÒѾÓÐ6È˻ظ´
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
zhongguo1hao
Òø³æ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 254
- Ìû×Ó: 22
- ÔÚÏß: 10.3Сʱ
- ³æºÅ: 1649092
- ×¢²á: 2012-02-28
- רҵ: Ô˳ïѧ
3Â¥2012-03-04 16:36:17
autozh
Ìú¸Ëľ³æ (ÖøÃûдÊÖ)
- Ó¦Öú: 16 (СѧÉú)
- ½ð±Ò: 6547
- ºì»¨: 2
- Ìû×Ó: 2351
- ÔÚÏß: 557.9Сʱ
- ³æºÅ: 940592
- ×¢²á: 2010-01-11
- רҵ: µçÁ¦µç×Óѧ
4Â¥2012-03-04 17:03:47
zhongguo1hao
Òø³æ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 254
- Ìû×Ó: 22
- ÔÚÏß: 10.3Сʱ
- ³æºÅ: 1649092
- ×¢²á: 2012-02-28
- רҵ: Ô˳ïѧ
5Â¥2012-03-04 17:30:48
|
±¾ÌûÄÚÈݱ»ÆÁ±Î |
6Â¥2015-02-06 12:36:29
|
±¾ÌûÄÚÈݱ»ÆÁ±Î |
7Â¥2017-05-26 11:55:19
Á¶¹Äz79
гæ (³õÈëÎÄ̳)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: -27.5
- Ìû×Ó: 12
- ÔÚÏß: 20·ÖÖÓ
- ³æºÅ: 5977138
- ×¢²á: 2017-03-14
8Â¥2017-06-06 23:01:05













»Ø¸´´ËÂ¥