| ²é¿´: 561 | »Ø¸´: 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 |
» ²ÂÄãϲ»¶
»ù½ðϵͳʲôÄÚÈÝҲûÓÐ
ÒѾÓÐ6È˻ظ´
ÓжàÉÙÈËÊǽñÌì²éϵͳ֪µÀ½á¹ûµÄ£¿
ÒѾÓÐ17È˻ظ´
¹ú×ÔÈ»ÃæÉϸ´ÅÌ~»¶ÓÌÖÂÛ
ÒѾÓÐ12È˻ظ´
Ϊʲô×ÊÖúÊý¸÷´ó¸ßУ¶¼´´Ð¸ߣ¬×Ô¼ºÉêÇëÔõô¾ÍÕâôÄÑ
ÒѾÓÐ9È˻ظ´
ÊÛSCIÒ»ÇøÎÄÕ£¬ÎÒ:8O5.5.1.O5.4,¿ÆÄ¿È«,¿ÉÙ¤¼±
ÒѾÓÐ3È˻ظ´
ÄÄλ¸ßÈËÖÐÁË£¬°Ñ²éѯµ½µÄ½ØÍ¼Ìù³öÀ´ÈÃÎÒ¿´¿´£¬ÈÃÎÒ³¤³¤¼ûʶ
ÒѾÓÐ6È˻ظ´
ÊÛSCIÎÄÕ£¬ÎÒ:8O5.5.1.O.54,¿ÆÄ¿ÆëÈ«,¿É+¼±
ÒѾÓÐ4È˻ظ´
ÃæÉϺÏ×÷µ¥Î»¸ÇÕÂ
ÒѾÓÐ5È˻ظ´
µ¼Ê¦Í²ۣºÎÒÔõô̯ÉÏÁËÕâô¸ö¼«Æ·Ñо¿Éú£¡
ÒѾÓÐ7È˻ظ´
ÉêÇëɾ³ý±¾Ìû
ÒѾÓÐ7È˻ظ´
YANGZL
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 4 (Ó×¶ùÔ°)
- ½ð±Ò: 16003.4
- Ìû×Ó: 253
- ÔÚÏß: 521.5Сʱ
- ³æºÅ: 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
YANGZL
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 4 (Ó×¶ùÔ°)
- ½ð±Ò: 16003.4
- Ìû×Ó: 253
- ÔÚÏß: 521.5Сʱ
- ³æºÅ: 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









»Ø¸´´ËÂ¥