Folding = Colouring
| dc.creator | Wood, David R. | |
| dc.date | 2008-02-18 | |
| dc.date | 2008-02-25 | |
| dc.date.accessioned | 2026-07-07T09:22:43Z | |
| dc.date.available | 2026-07-07T09:22:43Z | |
| dc.description | The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The folding number of $G$ is the minimum order of a complete folding of $G$. Theorem: The folding number of every graph equals its chromatic number. | |
| dc.description | I have discovered that the main result was first proved by Cook and Evans in 1979 | |
| dc.identifier | https://arxiv.org/abs/0802.2467 | |
| dc.identifier | http://arxiv.org/abs/0802.2467 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/155476 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | Folding = Colouring | |
| dc.type | text |