期刊文献+

A Generalization of Steinhaus' Chessboard Problem 被引量:1

A Generalization of Steinhaus' Chessboard Problem
下载PDF
导出
摘要 In the present paper, a generalization of Steinhaus' chessboard problem of 8 × 8 and that of m×n are given and its solution is proved. Then, Steinhaus' chessboard problem is directly solved as a corollary, and the m>n case is solved immediately. In the present paper, a generalization of Steinhaus' chessboard problem of 8 × 8 and that of m×n are given and its solution is proved. Then, Steinhaus' chessboard problem is directly solved as a corollary, and the m>n case is solved immediately.
出处 《Northeastern Mathematical Journal》 CSCD 2004年第2期139-144,共6页 东北数学(英文版)
基金 The NNSF (10271017, 60373030, 10271048), the Beijing Natural Science Foundation (1012003) the Foundation of Beijing Jiaotong University.
关键词 GRAPH cut-set PATH graph, cut-set, path
  • 相关文献

参考文献4

  • 1Steinhaus, Hugo D., Problems and Thinking, World Press, Warsaw, 1974.
  • 2Zhao L. K., Yang Z. Q., The extension problem of the Steinhaus' chessboard problem,Submitted.
  • 3Bondy, J. A. and Murty, U. S. R., Graph Theory with Application, London and Macmillan Publishing, London, 1976.
  • 4Liu Y. P., Embeddability in Graphs, Kluwer, Boston, 1995.

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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