 |
|
|
|
| HAL : hal-00502201, version 4 |
| arXiv : 1201.5988 |
| Fiche détaillée |  Récupérer au format |
|
|
| Versions disponibles : | v1 (13-07-2010) | v2 (15-07-2010) | v3 (27-09-2011) | v4 (28-01-2012) |
|
|
|
|
| Tools for parsimonious edge-colouring of graphs with maximum degree three |
|
|
| Jean-Luc Fouquet 1Jean-Marie Vanherpe 1 |
|
|
| (28/01/2012) |
|
|
|
| The notion of a $\delta$-minimum edge-colouring was introduced by J-L. Fouquet (in his french PhD Thesis \cite{FouPhD}). Here we present some structural properties of $\delta$-minimum edge-colourings, partially taken from the above thesis. The paper serves as an auxiliary tool for another paper submitted by the authors to Graphs and Combinatorics. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Mathématique discrète |
|
|
| Cubic graph – Edge-colouring |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00502201, version 4 | |
| http://hal.archives-ouvertes.fr/hal-00502201 | |
| oai:hal.archives-ouvertes.fr:hal-00502201 | |
| Contributeur : Jean-Marie Vanherpe | |
| Soumis le : Samedi 28 Janvier 2012, 09:42:30 | |
| Dernière modification le : Samedi 28 Janvier 2012, 21:12:10 | |
