| Steinhause棋盘问题的一个推广 |
| |
| 引用本文： | 郝荣霞,刘彦佩.Steinhause棋盘问题的一个推广[J].东北数学,2004,20(2). |
| |
| 作者姓名： | 郝荣霞 刘彦佩 |
| |
| 作者单位： | Department of Mathematics，Beijing Jiaotong University，Beijing，100044，Department of Mathematics，Beijing Jiaotong University，Beijing，100044 |
| |
| 基金项目： | The NNSF (10271017, 60373030, 10271048), the Beijing Natural Science Foundation (1012003)，the Foundation of Beijing Jiaotong University. |
| |
| 摘 要： | 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.
|
A Generalization of Steinhaus' Chessboard Problem |
| |
| HAO Rong-xia and LIU Yan-pei.A Generalization of Steinhaus'''' Chessboard Problem[J].Northeastern Mathematical Journal,2004,20(2). |
| |
| Authors: | HAO Rong-xia and LIU Yan-pei |
| |
| Abstract: | |
| |
| Keywords: | graph cut-set path |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
