Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

Horizons in Combinatorics/16th Shanks Lecture Series
May 21-24, 2001
Vanderbilt University
Nashville, TN, USA

Organizers
Paul Edelman, Mark Ellingham, Jonathan Farley, Mike Plummer, Jerry Spinrad

View Abstracts
Conference Homepage

Coloring perfect quasi-adjoin graphs
by
Ahmed Hamadi
Département de Recherche Opérationnelle, Faculté des Sciences Mathématiques, USTHB, El alia BP32 Bab Ezzouar 16111 Alger, ALGERIE
Coauthors: Hacène AIT HADDADENE (Docteur Es-Sciences,Laboratoire LAID3, Département de Recherche Opérationnelle, Faculté des Sciences Mathématiques, USTHB, El alia BP32 Bab Ezzouar 16111 Alger, ALGERIE; Directeur de Thèse de monsieur HAMADI Ahmed)

In this paper, we consider a class of perfect quasi-adjoin graphs. We give a coloring theorem for them and a polynomial combinatorial algorithm for coloring any perfect quasi-adjoin graph. This polynomial combinatorial algorithm uses the new coloring technique which is called the trichromatic exchange.

Date received: April 21, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-73.