Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
Journal of Graph Theory
Saved in:
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104100 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | National University of Singapore |
| id |
sg-nus-scholar.10635-104100 |
|---|---|
| record_format |
dspace |
| spelling |
sg-nus-scholar.10635-1041002015-03-05T02:03:30Z Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs Dong, F.M. Koh, K.M. Teo, K.L. Little, C.H.C. Hendy, M.D. MATHEMATICS Bipartite graphs Chromatic equivalence Chromatic polynomials Chromatic uniqueness Journal of Graph Theory 37 1 48-77 JGTHD 2014-10-28T02:45:16Z 2014-10-28T02:45:16Z 2001-05 Article Dong, F.M.,Koh, K.M.,Teo, K.L.,Little, C.H.C.,Hendy, M.D. (2001-05). Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. Journal of Graph Theory 37 (1) : 48-77. ScholarBank@NUS Repository. 03649024 http://scholarbank.nus.edu.sg/handle/10635/104100 NOT_IN_WOS Scopus |
| institution |
National University of Singapore |
| building |
NUS Library |
| country |
Singapore |
| collection |
ScholarBank@NUS |
| topic |
Bipartite graphs Chromatic equivalence Chromatic polynomials Chromatic uniqueness |
| spellingShingle |
Bipartite graphs Chromatic equivalence Chromatic polynomials Chromatic uniqueness Dong, F.M. Koh, K.M. Teo, K.L. Little, C.H.C. Hendy, M.D. Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| description |
Journal of Graph Theory |
| author2 |
MATHEMATICS |
| author_facet |
MATHEMATICS Dong, F.M. Koh, K.M. Teo, K.L. Little, C.H.C. Hendy, M.D. |
| format |
Article |
| author |
Dong, F.M. Koh, K.M. Teo, K.L. Little, C.H.C. Hendy, M.D. |
| author_sort |
Dong, F.M. |
| title |
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| title_short |
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| title_full |
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| title_fullStr |
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| title_full_unstemmed |
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| title_sort |
sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs |
| publishDate |
2014 |
| url |
http://scholarbank.nus.edu.sg/handle/10635/104100 |
| _version_ |
1681093044387971072 |