output
20022009
most citedOn the perfect matching index of bridgeless cubic graphs

30 citations

researchers with a paper here
collaborating institutions

7 papers

cs.DM2009★ 30 cited

On the perfect matching index of bridgeless cubic graphs

Jean-Luc Fouquet, Jean-Marie Vanherpe

If is a bridgeless cubic graph, Fulkerson conjectured that we can find 6 perfect matchings of with the property that every edge of is contained in exactly…

cs.DM2008★ 1 cited

On normal odd partitions in cubic graphs

Jean-Luc Fouquet, Jean-Marie Vanherpe

A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We inv…

cs.DM2008★ 2 cited

On Fan Raspaud Conjecture

Jean-Luc Fouquet, Jean-Marie Vanherpe

A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possibl…

cs.LO2007

Theory of Finite or Infinite Trees Revisited

Khalil Djelloul, Thi-bich-hanh Dao, Thom Fruehwirth

We present in this paper a first-order axiomatization of an extended theory of finite or infinite trees, built on a signature containing an infinite set of function symbols and…

cs.PL2007

Une sémantique observationnelle du modèle des boîtes pour la résolution de programmes logiques (version étendue)

Pierre Deransart, Mireille Ducassé, Gérard Ferrand

This report specifies an observational semantics and gives an original presentation of the Byrd's box model. The approach accounts for the semantics of Prolog tracers independently…

cs.SE2003★ 7 cited

Towards declarative diagnosis of constraint programs over finite domains

Gerard Ferrand, Willy Lesaint, Alexandre Tessier

The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic de…