Jean-Marie Vanherpe

According to our database1, Jean-Marie Vanherpe authored at least 35 papers between 1997 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
On Compatible Normal Odd Partitions in Cubic Graphs.
J. Graph Theory, 2013

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

On minimum (<i>K<sub>q</sub>, k</i>) stable graphs.
Discuss. Math. Graph Theory, 2013

2012
On (K<sub>q</sub>, k) vertex stable graphs with minimum size.
Discret. Math., 2012

Reed's Conjecture on hole expansions
CoRR, 2012

Reed's conjecture on some special classes of graphs
CoRR, 2012

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

On (K<sub>q</sub>, k) Stable Graphs with Small k.
Electron. J. Comb., 2012

2011
On Fulkerson conjecture.
Discuss. Math. Graph Theory, 2011

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

2010
Mácajová and Skoviera conjecture on cubic graphs.
Discuss. Math. Graph Theory, 2010

On family of cubic graphs containing flower snarks.
Discuss. Math. Graph Theory, 2010

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

2009
On normal partitions in cubic graphs.
Discuss. Math. Graph Theory, 2009

On odd and semi-odd linear partitions of cubic graphs.
Discuss. Math. Graph Theory, 2009

On the perfect matching index of bridgeless cubic graphs
CoRR, 2009

2008
Kaiser and Raspaud conjecture on cubic Graphs with few vertices
CoRR, 2008

On normal odd partitions in cubic graphs
CoRR, 2008

On Fan Raspaud Conjecture
CoRR, 2008

On parcimonious edge-colouring of graphs with maximum degree three
CoRR, 2008

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

2007
On bipartite graphs with weak density of some subgraphs.
Discret. Math., 2007

2006
On isomorphic linear partitions in cubic graphs.
Electron. Notes Discret. Math., 2006

2004
On <i>I</i>-sparse graphs and other families: Extended abstract.
Electron. Notes Discret. Math., 2004

On minimal prime extensions of a four-vertex graph in a prime graph.
Discret. Math., 2004

Bimodular Decomposition of Bipartite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

On (P<sub>5</sub>, P<sub>5</sub>)-Sparse Graphs and other Families.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
Some optimization problems on weak-bisplit graphs.
Inf. Process. Lett., 2003

Structure and stability number of chair-, co-P- and gem-free graphs revisited.
Inf. Process. Lett., 2003

Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P<sub>6</sub>-Free Graphs.
Int. J. Found. Comput. Sci., 2003

2000
Clique width of Partner limited graphs.
Electron. Notes Discret. Math., 2000

Linear time recognition of Weak bisplit graphs.
Electron. Notes Discret. Math., 2000

1999
Bipartite Graphs Totally Decomposable by Canonical Decomposition.
Int. J. Found. Comput. Sci., 1999

On canonical decomposition of bipartite graphs.
Electron. Notes Discret. Math., 1999

1997
On Extended P<sub>4</sub>-Reducible and Extended P<sub>4</sub>-Sparse Graphs.
Theor. Comput. Sci., 1997


  Loading...