The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Marie Vanherpe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe
    Bimodular Decomposition of Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:117-128 [Conf]
  2. Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe
    On minimal prime extensions of a four-vertex graph in a prime graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:9-17 [Journal]
  3. Jean-Marie Vanherpe
    Clique-width of partner-limited graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:363-374 [Journal]
  4. Jean-Luc Fouquet, Jean-Marie Vanherpe
    On bipartite graphs with weak density of some subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1516-1524 [Journal]
  5. Vassilis Giakoumakis, Jean-Marie Vanherpe
    Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:1, pp:107-136 [Journal]
  6. Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe
    Bipartite Graphs Totally Decomposable by Canonical Decomposition. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:513-534 [Journal]
  7. Andreas Brandstädt, Hoàng-Oanh Le, Jean-Marie Vanherpe
    Structure and stability number of chair-, co-P- and gem-free graphs revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:161-167 [Journal]
  8. Jean-Marie Vanherpe
    Some optimization problems on weak-bisplit graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:6, pp:305-310 [Journal]
  9. Vassilis Giakoumakis, Jean-Marie Vanherpe
    On Extended P4-Reducible and Extended P4-Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:269-286 [Journal]

  10. On $(P_5,\bar{P_5})$-sparse graphs and other families [Citation Graph (, )][DBLP]


  11. On parcimonious edge-colouring of graphs with maximum degree three [Citation Graph (, )][DBLP]


  12. On Fan Raspaud Conjecture [Citation Graph (, )][DBLP]


  13. On normal odd partitions in cubic graphs [Citation Graph (, )][DBLP]


  14. Kaiser and Raspaud conjecture on cubic Graphs with few vertices [Citation Graph (, )][DBLP]


  15. On the perfect matching index of bridgeless cubic graphs [Citation Graph (, )][DBLP]


  16. On Fulkerson conjecture [Citation Graph (, )][DBLP]


  17. Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs [Citation Graph (, )][DBLP]


  18. On a family of cubic graphs containing the flower snarks [Citation Graph (, )][DBLP]


  19. On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002