.:. Consultation > Liste par discipline > Mathématique discrète .:.

36 documents classés par : Date Titre Nom du premier auteur Type de documents Date de dépôt

1 - 2

On parsimonious edge-colouring of graphs with maximum degree three Fouquet J.-L., Vanherpe J.-M. Graphs and Combinatorics 29, 3 (2013) 475-487 [hal-00325253 - version 6]

On Compatible Normal Odd Partitions in Cubic Graphs Fouquet J.-L., Vanherpe J.-M. Journal of Graph Theory 72, 4 (2013) 410-461 [hal-00144319 - version 2]

(Circular) backbone colouring: tree backbones in planar graphs Havet F., King A. D., Liedloff M., Todinca I. Rapport de recherche (2012) [hal-00759044 - version 1]

Reed's conjecture on some special classes of graphs Fouquet J.-L., Vanherpe J.-M. [hal-00694158 - version 2] (29/10/2012)

Reed's Conjecture on hole expansions Fouquet J.-L., Vanherpe J.-M. [hal-00694153 - version 2] (29/10/2012)

Tools for parsimonious edge-colouring of graphs with maximum degree three Fouquet J.-L., Vanherpe J.-M. Internal report RR-2010-10, revised version (2012) [hal-00502201 - version 4]

Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard Models Becker F., Kosowski A., Nisse N., Rapaport I., Suchan K. Dans ACM - Symposium on Parallelism in Algorithms and Architectures, États-Unis (2012) [hal-00704200 - version 1]

On $(K_q,k)$ vertex stable with minimum size Fouquet J.-L., Thuillier H., Vanherpe J.-M., Wojda A. P. Discrete Mathematics 312, 14 (2012) 2109:2118 [hal-00586145 - version 1]

On removable edges in 3-connected cubic graphs Fouquet J.-L., Thuillier H. Discrete Mathematics (2012) 9 [inria-00516060 - version 1]

On (K_(q),k) stable graphs with small k Fouquet J.L., Thuillier H., Vanherpe J.M., Wojda A. P. Rapport de recherche LIFO http://www.univ-orleans.fr/lifo/ Version modifiée soumise à publication (2011) [hal-00560277 - version 2]

Décompositions de graphes : quelques limites et obstructions Chapelle M. Université d'Orléans (2011-12-05), Ioan Todinca (Dir.) [tel-00659666 - version 2]

Jaeger's graphs and compatible linear partitions Fouquet J.-L., Thuillier H., Vanherpe J.-M., Wojda A. P. [hal-00601554 - version 1] (2011-06-19)

A new bound for parsimonious edge-colouring of graphs with maximum degree three. Fouquet J.-L., Vanherpe J.-M. Internal Report RR-2010-11 (2011) [hal-00516702 - version 2]

On minimum (Kq; k) stable graphs Fouquet J.-L., Thuillier H., Vanherpe J.-M., Wojda A. P. Research report (2011) 9 [hal-00648505 - version 1]

Adding a referee to an interconnection network: What can(not) be computed in one round. Becker F., Matamala M., Nisse N., Rapaport I., Suchan K., Todinca I. 25th IEEE International Symposium on Parallel & Distributed Processing (IPDPS), États-Unis (2011) [inria-00622976 - version 1]

Reconstruire un graphe en une ronde Florent B., Matamala M., Nisse N., Rapaport I., Suchan K., Todinca I. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), France (2011) [inria-00587250 - version 1]

On Fulkerson conjecture Fouquet J.-L., Vanherpe J.-M. Discussiones Mathematicae Graph Theory 31, 2 (2011) 253-272 [hal-00392009 - version 2]

On measures of the edge uncolorability of graphs with maximum degree thre Fouquet J.-L. [hal-00535558 - version 2] (27/01/2011)

Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs Fouquet J.-L., Vanherpe J.-M. [hal-00467642 - version 1] (27/03/2010)

Partitions Versus Sets : A Case of Duality Lyaudet L., Mazoit F., Thomassé S. European Journal of Combinatorics 31 (2010) 681-687 [lirmm-00512753 - version 1]