default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenri Thuillier
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j20]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)- 2012
- [j19]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) - [j18]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) - [j17]Jean-Luc Fouquet, Henri Thuillier:
On removable edges in 3-connected cubic graphs. Discret. Math. 312(17): 2652-2659 (2012) - 2010
- [j16]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) - [i1]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
- [j15]Florian Roussel, Irena Rusu, Henri Thuillier:
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. Discret. Math. 309(20): 6092-6113 (2009) - [j14]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) - [j13]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) - 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) - 2001
- [j11]Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier:
New classes of perfectly orderable graphs. Discret. Math. 236(1-3): 95-109 (2001)
1990 – 1999
- 1999
- [j10]Florian Roussel, Irena Rusu, Henri Thuillier:
On Graphs with Limited Number of P4-Partners. Int. J. Found. Comput. Sci. 10(1): 103-122 (1999) - 1997
- [j9]Jean-Luc Fouquet, Frédéric Maire, Irena Rusu, Henri Thuillier:
On transversals in minimal imperfect graphs. Discret. Math. 165-166: 301-312 (1997) - [j8]Vassilis Giakoumakis, Florian Roussel, Henri Thuillier:
Scattering number and modular decomposition. Discret. Math. 165-166: 321-342 (1997) - [j7]Vassilis Giakoumakis
, Florian Roussel, Henri Thuillier:
On P4-tidy graphs. Discret. Math. Theor. Comput. Sci. 1(1): 17-41 (1997) - [j6]Jean-Luc Fouquet, Igor Parfenoff, Henri Thuillier:
An O(n) Time Algorithm for Maximum Matching in P4-Tidy Graphs. Inf. Process. Lett. 62(6): 281-287 (1997) - 1995
- [j5]Jean-Luc Fouquet, Vassilis Giakoumakis, Frédéric Maire, Henri Thuillier:
On graphs without P5 and P5_. Discret. Math. 146(1-3): 33-44 (1995) - 1993
- [j4]Jean-Luc Fouquet, Henri Thuillier:
Decomposition of 3-connected cubic graphs. Discret. Math. 114(1-3): 181-198 (1993) - 1991
- [j3]Jean-Luc Fouquet, Henri Thuillier:
Non removable edges in 3-connected cubic graphs. Graphs Comb. 7(2): 119-141 (1991) - 1990
- [j2]Jean-Luc Fouquet, Henri Thuillier:
On some conjectures on cubic 3-connected graphs. Discret. Math. 80(1): 41-57 (1990)
1980 – 1989
- 1980
- [j1]Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. J. Graph Theory 4(4): 409-415 (1980)
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 2025-01-20 22:52 CET 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:
