A note on the chromaticity of some 2-connected (n,n + 3)-graphs
Discrete Mathematics
Saved in:
Main Authors: | Dong, P.M., Teo, K.L., Koh, K.M. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102714 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite 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) -
On graphs having no chromatic zeros in (1, 2)
by: Dong, F.M., et al.
Published: (2014) -
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial
by: Dong, F.M., et al.
Published: (2014) -
Structures and chromaticity of extremal 3-colourable sparse graphs
by: Dong, F.M., et al.
Published: (2014)