| 000 | 00943nam a22002057a 4500 | ||
|---|---|---|---|
| 005 | 20240409081938.0 | ||
| 008 | 240409b |||||||| |||| 00| 0 eng d | ||
| 022 | _a0025-570X | ||
| 100 | _aZhou, Jingkai | ||
| 245 |
_aAn Intriguing Graph Theory Problem From RMM 2019 _b(Journal Article) |
||
| 260 |
_aPhiladelphia, PA _b:Taylor & Francis Group _c, September 2023 |
||
| 300 | _a442-445p. | ||
| 440 |
_aMathematics Magazine _vVolume 96: Number 4, October 2023 |
||
| 505 | _a***______{For Hard Copy, Please visit Library.}________*** | ||
| 520 | _aAbstract: The 2019 Romanian Master of Mathematics Competition included an intriguing problem in graph theory. We present a concise solution that differs from that presented in the official competition documents. | ||
| 650 | _aMaster of Mathematics | Competition | graph theory | ||
| 700 | _aZhou, Wenjie | ||
| 856 | _uhttps://doi.org/10.1080/0025570X.2023.2231840 | ||
| 942 | _cPER | ||
| 999 |
_c45627 _d45626 |
||