default search action
Jean-Marie Vanherpe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j24]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
On minimum (Kq, k) stable graphs. Discuss. Math. Graph Theory 33(1): 101-115 (2013) - [j23]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three. Graphs Comb. 29(3): 475-487 (2013) - [j22]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Compatible Normal Odd Partitions in Cubic Graphs. J. Graph Theory 72(4): 440-461 (2013) - 2012
- [j21]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
On (Kq, k) Stable Graphs with Small k. Electron. J. Comb. 19(2): 50 (2012) - [j20]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On (Kq, k) vertex stable graphs with minimum size. Discret. Math. 312(14): 2109-2118 (2012) - [i14]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Compatible Normal Odd Partitions in Cubic Graphs. CoRR abs/1201.5729 (2012) - [i13]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Tools for parsimonious edge-colouring of graphs with maximum degree three. CoRR abs/1201.5988 (2012) - [i12]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Reed's conjecture on some special classes of graphs. CoRR abs/1205.0730 (2012) - [i11]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Reed's Conjecture on hole expansions. CoRR abs/1205.0731 (2012) - 2011
- [j19]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Fulkerson conjecture. Discuss. Math. Graph Theory 31(2): 253-272 (2011) - [i10]Jean-Luc Fouquet, Jean-Marie Vanherpe:
A new bound for parsimonious edge-colouring of graphs with maximum degree three. CoRR abs/1102.5523 (2011) - 2010
- [j18]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe:
On family of cubic graphs containing flower snarks. Discuss. Math. Graph Theory 30(2): 289-314 (2010) - [j17]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Mácajová and Skoviera conjecture on cubic graphs. Discuss. Math. Graph Theory 30(2): 315-333 (2010) - [i9]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs. CoRR abs/1003.5458 (2010) - [i8]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe:
On a family of cubic graphs containing the flower snarks. CoRR abs/1003.5459 (2010)
2000 – 2009
- 2009
- [j16]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. Discret. Math. 309(22): 6425-6433 (2009) - [j15]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On odd and semi-odd linear partitions of cubic graphs. Discuss. Math. Graph Theory 29(2): 275-292 (2009) - [j14]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On normal partitions in cubic graphs. Discuss. Math. Graph Theory 29(2): 293-312 (2009) - [i7]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On the perfect matching index of bridgeless cubic graphs. CoRR abs/0904.1296 (2009) - [i6]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Fulkerson conjecture. CoRR abs/0906.1086 (2009) - 2008
- [i5]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On $(P_5,\bar{P_5})$-sparse graphs and other families. CoRR abs/0803.2135 (2008) - [i4]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On parcimonious edge-colouring of graphs with maximum degree three. CoRR abs/0809.4747 (2008) - [i3]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Fan Raspaud Conjecture. CoRR abs/0809.4821 (2008) - [i2]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On normal odd partitions in cubic graphs. CoRR abs/0809.4822 (2008) - [i1]Jean-Luc Fouquet, Jean-Marie Vanherpe:
Kaiser and Raspaud conjecture on cubic Graphs with few vertices. CoRR abs/0809.4839 (2008) - 2007
- [j13]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On bipartite graphs with weak density of some subgraphs. Discret. Math. 307(11-12): 1516-1524 (2007) - 2006
- [j12]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. Electron. Notes Discret. Math. 24: 277-284 (2006) - 2004
- [j11]Jean-Marie Vanherpe:
Clique-width of partner-limited graphs. Discret. Math. 276(1-3): 363-374 (2004) - [j10]Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe:
On minimal prime extensions of a four-vertex graph in a prime graph. Discret. Math. 288(1-3): 9-17 (2004) - [j9]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On I-sparse graphs and other families: Extended abstract. Electron. Notes Discret. Math. 17: 163-167 (2004) - [c2]Jean-Luc Fouquet, Jean-Marie Vanherpe:
On (P5, P5)-Sparse Graphs and other Families. CTW 2004: 142-146 - [c1]Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe:
Bimodular Decomposition of Bipartite Graphs. WG 2004: 117-128 - 2003
- [j8]Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. Int. J. Found. Comput. Sci. 14(1): 107-136 (2003) - [j7]Andreas Brandstädt, Hoàng-Oanh Le
, Jean-Marie Vanherpe:
Structure and stability number of chair-, co-P- and gem-free graphs revisited. Inf. Process. Lett. 86(3): 161-167 (2003) - [j6]Jean-Marie Vanherpe:
Some optimization problems on weak-bisplit graphs. Inf. Process. Lett. 88(6): 305-310 (2003) - 2000
- [j5]Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear time recognition of Weak bisplit graphs. Electron. Notes Discret. Math. 5: 138-141 (2000) - [j4]Jean-Marie Vanherpe:
Clique width of Partner limited graphs. Electron. Notes Discret. Math. 5: 303-306 (2000)
1990 – 1999
- 1999
- [j3]Jean-Marie Vanherpe:
On canonical decomposition of bipartite graphs. Electron. Notes Discret. Math. 3: 199-204 (1999) - [j2]Jean-Luc Fouquet, Vassilis Giakoumakis, Jean-Marie Vanherpe:
Bipartite Graphs Totally Decomposable by Canonical Decomposition. Int. J. Found. Comput. Sci. 10(4): 513-534 (1999) - 1997
- [j1]Vassilis Giakoumakis, Jean-Marie Vanherpe:
On Extended P4-Reducible and Extended P4-Sparse Graphs. Theor. Comput. Sci. 180(1-2): 269-286 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: