Jean-Marie Vanherpe

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

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]

Henri Thuillier

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

On minimal prime extensions of a four-vertex graph in a prime graph.

[BibT_eX]

[DOI]

Andreas Brandstädt

Chính T. Hoàng

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

2003

Some optimization problems on weak-bisplit graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Structure and stability number of chair-, co-P- and gem-free graphs revisited.

[BibT_eX]

[DOI]

Andreas Brandstädt

Hoàng-Oanh Le

Inf. Process. Lett., 2003

Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

2000

Clique width of Partner limited graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

Linear time recognition of Weak bisplit graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2000

1999

Bipartite Graphs Totally Decomposable by Canonical Decomposition.

[BibT_eX]

[DOI]

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

On canonical decomposition of bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

1997

On Extended P4-Reducible and Extended P4-Sparse Graphs.

[BibT_eX]

[DOI]