On graphs in which any pair of colour classes but one induces a tree
Discrete Mathematics
Saved in:
Main Authors: | Dong, F.M., Koh, K.M. |
---|---|
Other Authors: | MATHEMATICS |
Format: | Article |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/103714 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the structure and chromaticity of graphs in which any two colour classes induce a tree
by: Dong, F.M., et al.
Published: (2014) -
Structures and chromaticity of some extremal 3-colourable graphs
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) -
Colourings of Cyclotomic Integers with Class Number One
by: De Las Peñas, Ma. Louise Antonette N, et al.
Published: (2011) -
Constructions of sensitive graphs which are not strongly sensitive
by: Koh, K.M., et al.
Published: (2014)