Jean‐Luc Fouquet

Laboratoire d’Informatique Fondamentale de Marseille — France

Computer Science · Physical Sciences

13h-index565citations79works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(70), Graph theory and applications(32), Graph Labeling and Dimension Problems(31), Limits and Structures in Graph Theory(27), graph theory and CDMA systems(17)

Publications79 total

Domination, coloring and stability in P5-reducible graphs
HAL (Le Centre pour la Communication Scientifique Directe)·2015
Domination, coloring and stability in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-reducible graphs
Discrete Applied Mathematics·2014· 2 cited
On $(K_{q},k)$ Stable Graphs with Small $k$
The Electronic Journal of Combinatorics·2012· 10 citedOpen Access
On Compatible Normal Odd Partitions in Cubic Graphs
Journal of Graph Theory·2012· 23 citedOpen Access
Reed's Conjecture on hole expansions
arXiv (Cornell University)·2012· 3 citedOpen Access
Reed's conjecture on some special classes of graphs
arXiv (Cornell University)·2012· 2 citedOpen Access
On Parsimonious Edge-Colouring of Graphs with Maximum Degree Three
Graphs and Combinatorics·2012· 18 citedOpen Access
Tools for parsimonious edge-colouring of graphs with maximum degree three
arXiv (Cornell University)·2012Open Access
Tools for parsimonious edge-colouring of graphs with maximum degree\n three
arXiv (Cornell University)·2012· 3 citedOpen Access
On removable edges in 3-connected cubic graphs
Discrete Mathematics·2011· 2 citedOpen Access
On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si4.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math> vertex stable graphs with minimum size
Discrete Mathematics·2011· 13 citedOpen Access
Jaeger's graphs and compatible linear partitions
HAL (Le Centre pour la Communication Scientifique Directe)·2011Open Access
A new bound for parsimonious edge-colouring of graphs with maximum degree three
arXiv (Cornell University)·2011Open Access
A new bound for parsimonious edge-colouring of graphs with maximum\n degree three
arXiv (Cornell University)·2011· 1 citedOpen Access
On minimum (Kq; k) stable graphs
HAL (Le Centre pour la Communication Scientifique Directe)·2011Open Access
On measures of the edge uncolorability of graphs with maximum degree thre
HAL (Le Centre pour la Communication Scientifique Directe)·2010Open Access
On $(K_{q},k)$ stable graphs with minimum size-Abstract
HAL (Le Centre pour la Communication Scientifique Directe)·2010
Seidel complementation on ($P_5$, $House$, $Bull$)-free graphs
arXiv (Cornell University)·2010Open Access
On a sub-class of cubic graphs containing the Flower Snarks
HAL (Le Centre pour la Communication Scientifique Directe)·2010
Mácajová and \v{S}koviera Conjecture on Cubic Graphs.
HAL (Le Centre pour la Communication Scientifique Directe)·2010Open Access
page 1 of 4Next →

Frequent Co-authors

Jean-Marie Vanherpe(20), Henri Thuillier(9), A. Paweł Wojda(4), Vassilis Giakoumakis(3), Michel Habib(2), André Bouchet(2), Evelyne Flandrin(2), Abdelhamid Benhocine(2), Vincent Barré(2), Jean-Loup Jolivet(2), Frédéric Maire(1), J Bermond(1), Bernard Péroche(1), Adrian Bondy(1), Jean Fonlupt(1), Fabien de Montgolfier(1), H. Li(1), I. Parfenoff(1), Michel Rivière(1), Francette Bories(1)