| ²é¿´: 486 | »Ø¸´: 3 | |||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | |||
hzsh2009ͳæ (СÓÐÃûÆø)
|
[ÇóÖú]
graph coloring
|
||
|
Suppose a map is made by drawing n intersecting circles. Show that the regions in this map can be properly 2-colored Solve by assigning colors based on number of circles that contain a region |
» ²ÂÄãϲ»¶
0703»¯Ñ§µ÷¼Á£¬Çóµ¼Ê¦ÊÕ
ÒѾÓÐ10È˻ظ´
¸÷λÀÏʦºÃ£¬ÎÒµÄһ־ԸΪ±±¾©¿Æ¼¼´óѧ085601²ÄÁÏר˶
ÒѾÓÐ5È˻ظ´
һ־Ը̫ÔÀí¹¤°²È«¹¤³Ì300·Ö£¬Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
0856Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
11408Èí¼þ¹¤³ÌÇóµ÷¼Á
ÒѾÓÐ3È˻ظ´
Ò»Ö¾Ô¸211 ³õÊÔ270·Ö Çóµ÷¼Á
ÒѾÓÐ8È˻ظ´
300Çóµ÷¼Á£¬²ÄÁÏ¿ÆÑ§Ó¢Ò»Êý¶þ
ÒѾÓÐ6È˻ظ´
ѧ˶274Çóµ÷¼Á
ÒѾÓÐ9È˻ظ´
±¾¿ÆË«·Ç²ÄÁÏ£¬¿ç¿¼Ò»Ö¾Ô¸»ªµç085801µçÆø£¬283Çóµ÷¼Á£¬ÈκÎרҵ¶¼¿ÉÒÔ
ÒѾÓÐ7È˻ظ´
317·Ö Ò»Ö¾Ô¸ÄÏÀí¹¤²ÄÁϹ¤³Ì ±¾¿Æºþ¹¤´ó Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
e-texÎļþÔËÐв»ÁË
ÒѾÓÐ8È˻ظ´
YANGZL
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 4 (Ó×¶ùÔ°)
- ½ð±Ò: 15520.4
- Ìû×Ó: 253
- ÔÚÏß: 497.8Сʱ
- ³æºÅ: 1422023
- ×¢²á: 2011-09-29
- ÐÔ±ð: GG
- רҵ: µçÁ¦ÏµÍ³
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
|
²»»á¡£ ÏÂÃæµÄÏë·¨£¬½ö¹©²Î¿¼¡£ Cycle graphs shi 2×ÅÉ«µÄ¡£2¸ö circles intersect£¬»á»áÐγÉ3¸öcircles¡£n intersecting circles£¬»á³É²»³¬¹ý¡°×éºÏÊý¡±µÄcircles¡£ ²»ÖªµÀÕâ¸ö˼·ÓÐûÓÐÓᣠ°³²»ÊÇѧÊýѧµÄ£¬Ö»ÊÇÊýѧ°®ºÃÕß¡£Ã»ÓÐÄÜÁ¦±£Ö¤½â´ðµÄ¼ÛÖµ¡£ °³Ï¹Ï룺 made by drawing£¬¿É²»Äܱ£Ö¤½á¹ûÒ»¶¨Æ½ÃæÍ¼°¡£¡ k3,3 k5 Ò²ÊÇÔÚÆ½ÃæÉÏdrawnµÄ°¡£¬Ö»ÊÇËüÃǵÄÁ¬½Ó·½Ê½ÆæÌØÁ˵㡣 |

4Â¥2011-10-02 09:05:55
YANGZL
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 4 (Ó×¶ùÔ°)
- ½ð±Ò: 15520.4
- Ìû×Ó: 253
- ÔÚÏß: 497.8Сʱ
- ³æºÅ: 1422023
- ×¢²á: 2011-09-29
- ÐÔ±ð: GG
- רҵ: µçÁ¦ÏµÍ³
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¡ï
soliton923(½ð±Ò+1): лл²ÎÓëÌÖÂÛ~~Äã»ØÌû¾ÍÐÐÁË£¬Ã»ÓбØÒªÃ¿¸ö¶¼ÐèÒª¾Ù±¨¸ø°æÖ÷´¦Àí£¬ºÇºÇ 2011-10-01 17:56:42
soliton923(½ð±Ò+1): лл²ÎÓëÌÖÂÛ~~Äã»ØÌû¾ÍÐÐÁË£¬Ã»ÓбØÒªÃ¿¸ö¶¼ÐèÒª¾Ù±¨¸ø°æÖ÷´¦Àí£¬ºÇºÇ 2011-10-01 17:56:42
|
Ó¦¸Ã²»¿ÉÒÔ¡£ ԲȦÏཻºó£¬¾ÍÊÇÆ½ÃæÍ¼¡£ÓÃËÄÉ«¾Í¿ÉÒÔ¡£ ¹Ø¼üÊÇÔõôÏཻµÄ£¿Èç¹ûÏཻ³ö Kuratowski graph k3,3 k5£¬ÄÇô4ɫҲ²»¹»¡£ |

2Â¥2011-10-01 12:57:53
hzsh2009
ͳæ (СÓÐÃûÆø)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 123.9
- É¢½ð: 146
- Ìû×Ó: 161
- ÔÚÏß: 30Сʱ
- ³æºÅ: 1223739
- ×¢²á: 2011-03-07
3Â¥2011-10-01 20:50:30














»Ø¸´´ËÂ¥