Jean Fonlupt

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Chromatic characterization of biclique covers Discrete Mathematics	2006-04-28	Paper
Critical extreme points of the 2-edge connected spanning subgraph polytope Mathematical Programming. Series A. Series B	2006-01-13	Paper
scientific article; zbMATH DE number 2196277 (Why is no real title available?)	2005-08-22	Paper
The stable set polytope and some operations on graphs Discrete Mathematics	2002-08-29	Paper
scientific article; zbMATH DE number 1342128 (Why is no real title available?)	1999-09-22	Paper
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs SIAM Journal on Discrete Mathematics	1994-12-01	Paper
Polyhedral consequences of the amalgam operation Discrete Mathematics	1994-08-29	Paper
Stable set bonding in perfect graphs and parity graphs Journal of Combinatorial Theory. Series B	1994-08-10	Paper
Dynamic programming and the graphical traveling salesman problem Journal of the ACM	1994-03-24	Paper
Compositions in the bipartite subgraph polytope Discrete Mathematics	1993-01-16	Paper
The traveling salesman problem in graphs with some excluded minors Mathematical Programming. Series A. Series B	1992-06-28	Paper
The complexity of generalized clique covering Discrete Applied Mathematics	1989-01-01	Paper
An integer analogue of Carathéodory's theorem Journal of Combinatorial Theory. Series B	1986-01-01	Paper
The traveling salesman problem on a graph and some related integer polyhedra Mathematical Programming	1985-01-01	Paper
scientific article; zbMATH DE number 3878985 (Why is no real title available?)	1984-01-01	Paper
scientific article; zbMATH DE number 3889583 (Why is no real title available?)	1984-01-01	Paper
Orientation of matrices Mathematical Programming Studies	1984-01-01	Paper
On the number of common bases of two matroids Discrete Mathematics	1983-01-01	Paper
Transformations which Preserve Perfectness and H-Perfectness of Graphs North-Holland Mathematics Studies	1982-01-01	Paper
L'affectation exponentielle et le problème du plus court chemin dans un graphe RAIRO - Operations Research	1981-01-01	Paper

Research outcomes over time

This page was built for person: Jean Fonlupt