期刊文献+

A Structural Theorem on Embedded Graphs and Its Application to Colorings 被引量:1

A Structural Theorem on Embedded Graphs and Its Application to Colorings
原文传递
导出
摘要 In this paper, a Lebesgue type theorem on the structure of graphs embedded in the surface of characteristic σ≤ 0 is given, that generalizes a result of Borodin on plane graphs. As a consequence, it is proved that every such graph without i-circuits for 4 ≤ i ≤ 11 - 3σ is 3-choosable, that offers a new upper bound to a question of Y. Zhao. In this paper, a Lebesgue type theorem on the structure of graphs embedded in the surface of characteristic σ≤ 0 is given, that generalizes a result of Borodin on plane graphs. As a consequence, it is proved that every such graph without i-circuits for 4 ≤ i ≤ 11 - 3σ is 3-choosable, that offers a new upper bound to a question of Y. Zhao.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2009年第1期47-50,共4页 数学学报(英文版)
基金 Research supported" by NSFC
关键词 circuit embedded graph COLORING circuit, embedded graph, coloring
  • 相关文献

参考文献14

  • 1Steinberg, R.: The state of the three color problem, Quo Vadis. Graph Theory? Gimbel, J., Kennedy, J. W. &: Quintas, L. V. (eds). Ann Discrete Math., 55, 211-248 (1993) 被引量:1
  • 2Borodin, O. V.: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. of Graph Theory, 21, 183-186 (1996) 被引量:1
  • 3Abbott, H. L., Zhou, B.: On small faces in 4-critical graphs. Ars Combin., 32 203-207 (1991) 被引量:1
  • 4Sanders, D. P., Zhao, Y.: A note on the three color problem. Graphs and Combinatorics, 11 91-94 (1995) 被引量:1
  • 5Borodin, O. V., Glebov, A. N., Raspaud, A., Salavatipour, M. R.: Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. of Combinatorial Theory Ser. B, 93, 303-311 (2005) 被引量:1
  • 6Xu, B.: On 3-colorable plane graphs without 5- and 7-circuits. J. Combin. Theory Ser B, 913, 958 963 (2006) 被引量:1
  • 7Borodin, O. V., Glebov, A. N.: A sufficient condition for the 3-colorability of plane graphs (in Russian). Diskretn. Anal. Issled. Oper. Ser. 1, 11 13-29 (2004) 被引量:1
  • 8Xu, B.: A 3-color theorem on plane graphs without 5-circuits. Acta Mathematica Sinica, English Series, 23(6), 1059-1062 (2007) 被引量:1
  • 9Borodin, O. V., Raspaud, A.: A sufficient condition for planar graphs to be 3-colorable. J. of Combinatorial Theory Set. B, 88, 17-27 (2003) 被引量:1
  • 10Zhao, Y.: 3-colorings of graphs embedded in surfaces. J. of Graph Theory, 33, 140-143 (2000) 被引量:1

同被引文献4

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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