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. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/104247 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On graphs having no chromatic zeros in (1, 2)
by: Dong, F.M., et al.
Published: (2014) -
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2)
by: Dong, F.M., et al.
Published: (2014) -
On zero-free intervals in (1, 2) of chromatic polynomials of some families of graphs
by: Dong, F.M., et al.
Published: (2014) -
An attempt to classify bipartite graphs by chromatic polynomials
by: Dong, F.M., et al.
Published: (2014) -
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs
by: Dong, F.M., et al.
Published: (2014)