On the Chromaticity of the Bipartite Graph K(m,n)-2
  
Key Words: complete bipartite graph   chromatically unique graph   partition into color class.  
Fund Project:
Author NameAffiliation
Zou Huiwen Dept. of Math & Comp. Sci.
Fuzhou Teachers′ College
Jiangxi 344000 
Hits: 2556
Download times: 2018
Abstract:
      Let K(m,n)-2 denote the bipartite graph obtained by deleting two edges from the complete bipartite graph K(m,n) . In this paper, we prove that (1) K(m,n)-2 is chromatically unique if 3≤m≤n and n+m-((n-m)+8)1/2>(n-m)/2+4 . (2) K(m,m)-2, K(m,m+1)-2 and K(m,m+2)-2 are all chromatically unique if m≥3 .
Citation:
DOI:10.3770/j.issn:1000-341X.1998.04.029
View Full Text  View/Add Comment