Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles

Discrete Mathematics

Saved in:
Bibliographic Details
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
id sg-nus-scholar.10635-102981
record_format dspace
spelling sg-nus-scholar.10635-1029812015-04-25T00:13:03Z Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles Koh, K.M. Teo, K.L. MATHEMATICS Discrete Mathematics 127 1-3 243-258 DSMHA 2014-10-28T02:32:00Z 2014-10-28T02:32:00Z 1994-03-15 Article Koh, K.M.,Teo, K.L. (1994-03-15). Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discrete Mathematics 127 (1-3) : 243-258. ScholarBank@NUS Repository. 0012365X http://scholarbank.nus.edu.sg/handle/10635/102981 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
country Singapore
collection ScholarBank@NUS
description Discrete Mathematics
author2 MATHEMATICS
author_facet MATHEMATICS
Koh, K.M.
Teo, K.L.
format Article
author Koh, K.M.
Teo, K.L.
spellingShingle Koh, K.M.
Teo, K.L.
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
author_sort Koh, K.M.
title Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
title_short Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
title_full Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
title_fullStr Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
title_full_unstemmed Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
title_sort chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/102981
_version_ 1681092837363417088