Motions on n-Simplex Graphs with m-value memory
| dc.creator | Zucker, Marc | |
| dc.date | 2003-10-01 | |
| dc.date.accessioned | 2026-07-07T05:01:34Z | |
| dc.date.available | 2026-07-07T05:01:34Z | |
| dc.description | We introduce the idea of an n-simplex graph and games upon simplicial complexes. We then define moves on a labeled graph and pose the problem of whether given two labelings of a graph it is possible to change one into another via these moves. We then solve the problem for a given class of graphs. Once having found a solution for a given class of graphs we determine the number of different solutions that exist. We then use this to find an algorithm to determine whether a graph is (n+1)-colorable, and in particular, whether it is 3-colorable. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/math/0310015 | |
| dc.identifier | http://arxiv.org/abs/math/0310015 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68720 | |
| dc.subject | Combinatorics | |
| dc.subject | 91A43 | |
| dc.title | Motions on n-Simplex Graphs with m-value memory | |
| dc.type | text |