On Hadwiger Conjecture
| dc.creator | Mehendale, Dhananjay P. | |
| dc.date | 2007-05-01 | |
| dc.date | 2007-06-21 | |
| dc.date.accessioned | 2026-07-07T08:11:14Z | |
| dc.date.available | 2026-07-07T08:11:14Z | |
| dc.description | We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then define correct contraction procedure to be executed to get largest possible complete graph from given connected graph. We finally give a characterization for k-chromatic graphs and use it to settle Hadwigers conjecture. | |
| dc.description | 11 pages. Theorem 5.1 is extended to incorporate the graphs which themselves are less than k-chromatic but have arrived at by suitable contractions, in the sense of algorithm 5.1, from a k-chromatic graph | |
| dc.identifier | https://arxiv.org/abs/0705.0100 | |
| dc.identifier | http://arxiv.org/abs/0705.0100 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/132057 | |
| dc.subject | General Mathematics | |
| dc.title | On Hadwiger Conjecture | |
| dc.type | text |