Graphs & Applications
Publications of Arnaud PÊCHER

(bibtex format)
[publications of the team]

Copyrights for some of the papers below have been transfered, or will be transfered to various publishers of journals, conferences proceedings, etc. For such papers I am required to post the following notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. Publisher's copyright policy are available at © SIAM, © ACM, © IEEE, © Springer, © Elsevier, © Ideal, © King's College.


[ 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000]


2006

  1. A. Pêcher and X. Zhu. On the circular chromatic number of circular partitionable graphs. J. of Graph Theory, 2006. accepted.

  2. A. Pêcher and A. Wagler. On non-rank facets in stable set polytopes of webs with clique number four. Discrete Applied Math., 154(9):1408-1415, 2006.

  3. A. Pêcher and A. Wagler. A construction for non-rank facets of stable set polytopes of webs. European J. of Comb., 2006. accepted.

  4. A. Pêcher and A. Wagler. Almost all webs are not rank-perfect. Math. prog., 105(2-3):311-328, 2006.



2005

  1. S. Coulonges, A. Pêcher, and A. Wagler. On stable set polytopes of circular-perfect graphs. In ALIO/EURO V conference on combinatorial optimization, October 2005. talk by S. Coulonges.

  2. S. Coulonges, A. Pêcher, and A. Wagler. On strongly circular-perfectness. In ICGT'05 - 7th International Colloquium on Graph Theory, volume 22 of Electron. Notes Discrete Math., pages 369-374. Elsevier, September 2005. talk by S. Coulonges.

  3. S. Coulonges, A. Pêcher, and A. Wagler. On the imperfection ratio of a-perfect graphs and some consequences. In CTW'05 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization, May 2005. LaBRI Research Report RR-1359-05.

  4. S. Coulonges, A. Pêcher, and A.K. Wagler. Polytope des stables des graphes fortement circulaires-parfaits. JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinatoire, Marseille - talk by S. Coulonges, 2005.

  5. S. Coulonges, A. Pêcher, and A.K. Wagler. On the imperfection ratio of a-perfect webs. 8th Combinatorial Optimization Workshop, Aussois - talk by A.K. Wagler, 2005.

  6. S. Coulonges, A. Pêcher, and A.K. Wagler. Graphes fortement circulaires-parfaits sans triangles. JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinato ire, Marseille, 2005.

  7. A. Pêcher, A. Wagler, and X. Zhu. Three classes of minimal circular imperfect graphs. In Proceedings of GRACO2005, volume 19 of Electron. Notes Discrete Math., pages 9-15, Rio de Janeiro, Brazil, 2005. Elsevier.

  8. S. Coulonges, A. PÃcª¿½her, and A.K. Wagler. Triangle free strongly circular-perfect graphs. Eurocomb'05, poster, 2005.



2004

  1. A. Pêcher and A. Wagler. Almost all webs are not rank-perfect. XXXV Annual Conference of the Operational Research Society of Italy - talk by A. Wagler, septembre 2004.

  2. A. Pêcher. Cayley partitionable graphs and near-factorizations of finite groups. Discrete Math., 276(1-3):295-311, 2004. 6th International Conference on Graph Theory.

  3. A. Pêcher, A.K. Wagler, and X. Zhu. Quelques familles de graphes minimaux imparfaits circulaires. 6èmes Journées Graphes et Algorithmes, Grenoble, Les Cahiers du laboratoire Leibniz, 2004.



2003

  1. A. Pêcher and A. Wagler. A construction for non-rank facets of stable set polytopes of webs. In Eurocomb'03, pages 301-305, September 2003. full version accepted in European J. of Comb.

  2. A. Pêcher and X. Zhu. Colorations circulaires des graphes circulaires partitionnables. Journées GRAAL, Dijon, avril 2003.

  3. A. Pêcher and A. Wagler. Almost all webs are not rank-perfect. 7th Combinatorial Optimization Workshop, Aussois, mars 2003.

  4. Arnaud Pêcher. Partitionable graphs arising from near-factorizations of finite groups. Discrete Math., 269(1-3):191-218, 2003.

  5. A. Pêcher and A. K. Wagler. La plupart des webs ne sont pas rang-parfaits. Journées Polyèdres et Optimisation Combinatoire JPOC, Clermont-Ferrand, 2003.

  6. A. Pêcher and A. Wagler. On non-rank facets in stable set polytopes of webs with clique number four. In Electronic Notes in Discrete Mathematics, volume 13, pages 96-99. 2nd Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2003. full version accepted in Discrete Applied Mathematics.

  7. A. Pêcher. A note on the circular chromatic number of circular perfect planar graphs. LaBRI Research Report RR-1309-03, 2003.



2002

  1. A. Pêcher and A. Wagler. How imperfect are webs and antiwebs. XXXIII Annual Conference of the Operational Research Society of Italy - talk by A. Wagler, septembre 2002.



2001

  1. A. Pêcher. Getting partitionable graphs from another one, by modifying only two maximum cliques. Technical report, I.A.S.I., 2001.



2000

  1. A. Pêcher. Graphes de cayley partitionnables. PhD thesis, University of Orleans, France, December 2000.

  2. A. Pêcher. NFFinder, 2000.

  3. A. Pêcher. Cayley partitionable graphs. In 6th International Conference on Graph Theory (Marseille, 2000), volume 5 of Electron. Notes Discrete Math., page 4 pp. (electronic). Elsevier, Amsterdam, 2000.



10 janvier 2008 (27)
[home page of the team]