Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Vites Longani | en_US |
| dc.contributor.author | Hatairat Yingtaweesittikul | en_US |
| dc.date.accessioned | 2018-09-05T03:06:13Z | - |
| dc.date.available | 2018-09-05T03:06:13Z | - |
| dc.date.issued | 2016-08-01 | en_US |
| dc.identifier.issn | 16860209 | en_US |
| dc.identifier.other | 2-s2.0-84985905527 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84985905527&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/55941 | - |
| dc.description.abstract | © 2016 by the Mathematical Association of Thailand. All rights reserved. Let there be n students, and n row seats. For n days, a seat is arranged for each student on each day, and each student is required to sit on different seat on each of the n days. Also for these n days, it is required that each student shall has one chance to sit next to every other (n-1) students on one of his side, and shall has one chance to sit next to every other (n-1) students on the other one of his side. In this paper, we provide sufficient conditions and an algorithm for the arrangements. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | Seat arrangement problems | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Thai Journal of Mathematics | en_US |
| article.volume | 14 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| Appears in Collections: | CMUL: Journal Articles | |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.