期刊文献+

两个只有路型二色子图的极大平面图 被引量:1

Tow Maximal Planar Graphs with Path Bichromatic Subgraph Only.
下载PDF
导出
摘要  本文证明了极大平面图g9D和g12A,其每个四着色的每个二色子图都是路.并猜测在全部无分离三圈的极大平面图中这是仅有的两个图. In this planar graphs gOD planar graphs. paper, it is proved and g12A is a path. that every bichromatic subgrap We conjecture that there is not h of every 4-coloring any other graph in all of maximal of maximal
作者 许寿椿
出处 《中央民族大学学报(自然科学版)》 2005年第1期5-9,共5页 Journal of Minzu University of China(Natural Sciences Edition)
关键词 四色问题 四着色算法 极大平面图 二色子图 色多项式 four color problem four coloring algorithm maximal planar graph bichromatic subgraph chromatic polynomial
  • 相关文献

参考文献12

  • 1[1]ORE O. The four-color problem[M]. New York: Academic Press, 1967.
  • 2[2]RINGEL G. Map color theorem[M]. New York: Springer-Verlag, 1974.
  • 3[3]SAATY T L, KAINEN P C. The four-color problem: assaults and conquest[M]. New York: McGraw-Hill, 1977.
  • 4[4]ROBERTSON N, SANDERS D P, SEYMOUR, P D, THOMAS R. The four-colour theorem[J]. J. Comb. Theory Ser.,1996,B 70: 2-44.
  • 5[5]H. WHITNEY, W T TUTTE. Kempe chains and the four colour problem[A]. D R FULKE RSON. studies in Graph Theory [C]. Part ll,Math. Assoc. of America, Washington, 1975.378-413.
  • 6[6]SEYMOUR, P D. progress on the four color theorem[A]. S D CHATTERJI. proceedings of the International congress of Math., ICM' 94 [C]. august, 1994.183-195.
  • 7[7]RUDOLF FRITSCH, GERDA FRITSCH. The four- color theorem[M]. Springer, 1998.
  • 8[8]CAPOBIANCO M, MOLLUZZO J L. Examples and Counterexamples in Graph Theory[M]. North-Holland, New York, 1978.
  • 9[9]APPLE K, HAKEN W. Every planar map is four-colorable, Discharging[J]. Illinois J. Math., 1997,21:429-490.
  • 10[10]APPLE K, HAKEN W. Every planar map is four-colorable, Reducibility[J]. Illinois J. Math., 1997,21:491-567.

共引文献11

同被引文献1

  • 1许寿椿.极大平面图的层圈结构及其二色子图[J].中央民族大学学报(自然科学版),1993,2(1):6-10.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部