Jean-Luc Fouquet

Frédéric Maffray

Discret. Appl. Math., 2015

2013

On Compatible Normal Odd Partitions in Cubic Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three.

[BibT_eX]

[DOI]

Graphs Comb., 2013

On minimum (Kq, k) stable graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

2012

On (Kq, k) vertex stable graphs with minimum size.

[BibT_eX]

[DOI]

Discret. Math., 2012

On removable edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Reed's Conjecture on hole expansions

[BibT_eX]

[DOI]

CoRR, 2012

Reed's conjecture on some special classes of graphs

[BibT_eX]

[DOI]

CoRR, 2012

Tools for parsimonious edge-colouring of graphs with maximum degree three

[BibT_eX]

[DOI]

CoRR, 2012

On (Kq, k) Stable Graphs with Small k.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

On Fulkerson conjecture.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2011

A new bound for parsimonious edge-colouring of graphs with maximum degree three

[BibT_eX]

[DOI]

CoRR, 2011

2010

Mácajová and Skoviera conjecture on cubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

On family of cubic graphs containing flower snarks.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2010

Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs

[BibT_eX]

[DOI]

CoRR, 2010

2009

On normal partitions in cubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

On odd and semi-odd linear partitions of cubic graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

On the perfect matching index of bridgeless cubic graphs

[BibT_eX]

[DOI]

CoRR, 2009

2008

Kaiser and Raspaud conjecture on cubic Graphs with few vertices

[BibT_eX]

[DOI]

CoRR, 2008

On normal odd partitions in cubic graphs

[BibT_eX]

[DOI]

CoRR, 2008

On Fan Raspaud Conjecture

[BibT_eX]

[DOI]

CoRR, 2008

On parcimonious edge-colouring of graphs with maximum degree three

[BibT_eX]

[DOI]

CoRR, 2008

On $(P_5,\bar{P_5})$-sparse graphs and other families

[BibT_eX]

[DOI]

CoRR, 2008

2007

On bipartite graphs with weak density of some subgraphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

2006

On isomorphic linear partitions in cubic graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2004

On I-sparse graphs and other families: Extended abstract.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Preface.

[BibT_eX]

[DOI]

Irena Rusu

Discret. Math., 2004

Bimodular Decomposition of Bipartite Graphs.

[BibT_eX]

[DOI]

Michel Habib

Fabien de Montgolfier

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

On (P5, P5)-Sparse Graphs and other Families.

[BibT_eX]

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2002

No odd pairs in minimal imperfect NP5 graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

2001

New classes of perfectly orderable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

On minimal cutsets in P5-free minimal imperfect graphs.

[BibT_eX]

[DOI]

Vincent Barré

Discret. Math., 2001

Cycle regular graphs need not be transitive.

[BibT_eX]

[DOI]

Gena Hahn

Discret. Appl. Math., 2001

1999

Bipartite Graphs Totally Decomposable by Canonical Decomposition.

[BibT_eX]

[DOI]

Vassilis Giakoumakis

Int. J. Found. Comput. Sci., 1999

On Minimal Imperfect Graphs Without Induced P5.

[BibT_eX]

[DOI]

Vincent Barré

Discret. Appl. Math., 1999

1997

An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs.

[BibT_eX]

[DOI]

Igor Parfenoff

Inf. Process. Lett., 1997

Preface.

[BibT_eX]

[DOI]

Pierre Rosenstiehl

Discret. Math., 1997

On transversals in minimal imperfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

On semi-P4-sparse graphs.

[BibT_eX]

[DOI]

Vassilis Giakoumakis

Discret. Math., 1997

On the optimal transversals of the odd cycles.

[BibT_eX]

[DOI]

Claude Berge

Discret. Math., 1997

1995

On graphs without P5 and P5_.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Expansion of Centered Triangulations.

[BibT_eX]

[DOI]

Dominique Bénard

J. Comb. Theory B, 1994

On m-centers in Pt-free graphs.

[BibT_eX]

[DOI]

Odile Favaron

Discret. Math., 1994

Hamiltonicity of Bipartite Biclaw-free Graphs.

[BibT_eX]

[DOI]

Evelyne Flandrin

Hao Li

Discret. Appl. Math., 1994

1993

A Strengthening of Ben Rebea's Lemma.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1993

Mutual placement of bipartite graphs.

[BibT_eX]

[DOI]

A. Pawel Wojda

Discret. Math., 1993

Decomposition of 3-connected cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

A decomposition for a class of (P5, P5_5)-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1993

On hamiltonian claw-free graphs.

[BibT_eX]

[DOI]

Evelyne Flandrin

Hao Li

Discret. Math., 1993

1991

Non removable edges in 3-connected cubic graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1991

1990

On some conjectures on cubic 3-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 1990

1987

Pancyclic and panconnected line graphs.

[BibT_eX]

[DOI]

Abdelhamid Benhocine

J. Graph Theory, 1987

The Chvátal-Erdös condition and pancyclic line-graphs.

[BibT_eX]

[DOI]

Abdelhamid Benhocine

Discret. Math., 1987

1986

(m)-covering of a triangulation.

[BibT_eX]

[DOI]

Dominique Bénard

André Bouchet

Discret. Math., 1986

1984

On linear k-arboricity.

[BibT_eX]

[DOI]

Discret. Math., 1984

1982

Note sur la non existence d'un snark d'ordre 16.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre.

[BibT_eX]

[DOI]