 |
|
|
|
| HAL: hal-00325255, version 2 |
| arXiv: 0809.4839 |
| Detailed view |  Export this paper |
|
|
| Discussiones Mathematicae Graph Theory 30, 2 (2010) 315-333 |
|
|
| Available versions: | v1 (2008-09-28) | v2 (2009-11-07) |
|
|
|
|
| Mácajová and \v{S}koviera Conjecture on Cubic Graphs. |
|
|
| Jean-Luc Fouquet 1Jean-Marie Vanherpe 1 |
|
|
| (2010) |
|
|
|
| A conjecture of Má\u{c}ajová and \u{S}koviera asserts that every bridgeless cubic graph has two perfect matchings whose intersection does not contain any odd edge cut. We prove this conjecture for graphs with few vertices and we give a stronger result for traceable graphs. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Discrete Mathematics |
|
|
| Cubic graph – Edge-partition – Traceable graphs |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00325255, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00325255 | |
| oai:hal.archives-ouvertes.fr:hal-00325255 | |
| From: Jean-Marie Vanherpe | |
| Submitted on: Saturday, 7 November 2009 15:48:50 | |
| Updated on: Friday, 21 May 2010 14:17:50 | |
