On the chromatic uniqueness of certain bipartite graphs

On the chromatic uniqueness of certain bipartite graphs

Let K(p, q), p ≤ q, denote the complete bipartite graph in which the two partite sets consist of p and q vertices, respectively. We denote by K-r(p, q), the family of all graphs obtained by deleting any r distinct edges from K(p, q). Teo and Koh showed that K-1(p, q) is chromatically unique (in shor...

Full description

Bibliographic Details
Main Author: Peng, Y.H.
Format: Article
Published: Elsevier 1991
Online Access:http://psasir.upm.edu.my/id/eprint/114124/

Similar Items

Similar Items