An attempt to classify bipartite graphs by chromatic polynomials

Discrete Mathematics

Saved in:
Bibliographic Details
Main Authors: Dong, F.M., Koh, K.M., Teo, K.L., Little, C.H.C., Hendy, M.D.
Other Authors: MATHEMATICS
Format: Article
Published: 2014
Subjects:
Online Access:http://scholarbank.nus.edu.sg/handle/10635/102824
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
id sg-nus-scholar.10635-102824
record_format dspace
spelling sg-nus-scholar.10635-1028242024-11-11T04:23:34Z An attempt to classify bipartite graphs by chromatic polynomials Dong, F.M. Koh, K.M. Teo, K.L. Little, C.H.C. Hendy, M.D. MATHEMATICS Bipartite graphs Chromatic equivalence Chromatic polynomials Discrete Mathematics 222 1-3 73-88 DSMHA 2014-10-28T02:30:07Z 2014-10-28T02:30:07Z 2000-07-28 Article Dong, F.M.,Koh, K.M.,Teo, K.L.,Little, C.H.C.,Hendy, M.D. (2000-07-28). An attempt to classify bipartite graphs by chromatic polynomials. Discrete Mathematics 222 (1-3) : 73-88. ScholarBank@NUS Repository. 0012365X http://scholarbank.nus.edu.sg/handle/10635/102824 NOT_IN_WOS Scopus
institution National University of Singapore
building NUS Library
continent Asia
country Singapore
Singapore
content_provider NUS Library
collection ScholarBank@NUS
topic Bipartite graphs
Chromatic equivalence
Chromatic polynomials
spellingShingle Bipartite graphs
Chromatic equivalence
Chromatic polynomials
Dong, F.M.
Koh, K.M.
Teo, K.L.
Little, C.H.C.
Hendy, M.D.
An attempt to classify bipartite graphs by chromatic polynomials
description Discrete Mathematics
author2 MATHEMATICS
author_facet MATHEMATICS
Dong, F.M.
Koh, K.M.
Teo, K.L.
Little, C.H.C.
Hendy, M.D.
format Article
author Dong, F.M.
Koh, K.M.
Teo, K.L.
Little, C.H.C.
Hendy, M.D.
author_sort Dong, F.M.
title An attempt to classify bipartite graphs by chromatic polynomials
title_short An attempt to classify bipartite graphs by chromatic polynomials
title_full An attempt to classify bipartite graphs by chromatic polynomials
title_fullStr An attempt to classify bipartite graphs by chromatic polynomials
title_full_unstemmed An attempt to classify bipartite graphs by chromatic polynomials
title_sort attempt to classify bipartite graphs by chromatic polynomials
publishDate 2014
url http://scholarbank.nus.edu.sg/handle/10635/102824
_version_ 1821217316857184256