Chromatically unique bipartite graphs with certain 3-independent partition numbers III
For integers p, q, s with p ? q ? 2 and s ? 0 , let ( ) 2 , K?s p q denote the set of 2_connected bipartite graphs which can be obtained from K(p,q) by deleting a set of s edges. In this paper, we prove that for any graph ( ) 2 G?K?s p,q with p ? q ? 3 and 1 ? s ? q - 1 if the number of 3-independen...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Journal |
| Published: |
Malaysian Journal of Mathematical Sciences, Universiti Putra Malaysia
2007
|
| Subjects: | |
| Online Access: | http://www.myjurnal.my/public/article-view.php?id=14522 |