Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
Discrete Mathematics
Saved in:
Main Authors: | Koh, K.M., Teo, K.L. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/102981 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A note on the chromaticity of some 2-connected (n,n + 3)-graphs
by: Dong, P.M., et al.
Published: (2014) -
Two classes of chromatically unique graphs
by: Koh, K.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) -
The search for chromatically unique graphs
by: Koh, K.M., et al.
Published: (2014) -
On the chromatic uniqueness of the graph W(n, n - 2, k)
by: Dong, F.M., et al.
Published: (2016)