The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial
10.1002/jgt.20614
Saved in:
Main Authors: | Dong, F.M., Koh, K.M. |
---|---|
其他作者: | MATHEMATICS |
格式: | Article |
出版: |
2014
|
主題: | |
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/104247 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
On graphs having no chromatic zeros in (1, 2)
由: Dong, F.M., et al.
出版: (2014) -
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2)
由: Dong, F.M., et al.
出版: (2014) -
On zero-free intervals in (1, 2) of chromatic polynomials of some families of graphs
由: Dong, F.M., et al.
出版: (2014) -
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
由: Dong, F.M., et al.
出版: (2014) -
An attempt to classify bipartite graphs by chromatic polynomials
由: Dong, F.M., et al.
出版: (2014)