Chromatically unique bipartite graphs with low 3-independent partition numbers
Discrete Mathematics
Saved in:
Main Authors: | Dong, F.M., Koh, K.M., Teo, K.L., Little, C.H.C., Hendy, M.D. |
---|---|
其他作者: | MATHEMATICS |
格式: | Article |
出版: |
2014
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/102983 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
由: Dong, F.M., et al.
出版: (2014) -
An attempt to classify bipartite graphs by chromatic polynomials
由: Dong, F.M., et al.
出版: (2014) -
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
由: Dong, F.M., et al.
出版: (2014) -
Chromatically unique multibridge graphs
由: Dong, F.M., et al.
出版: (2014) -
Non-chordal graphs having integral-root chromatic polynomials II
由: Dong, P.M., et al.
出版: (2014)