Publication:
A result on chromatic uniqueness of edge-gluing of graphs

Simple item page
dc.citedby0
dc.contributor.authorChia G.L.en_US
dc.contributor.authorHo C.-K.en_US
dc.contributor.authorid55914572800en_US
dc.contributor.authorid7404653303en_US
dc.date.accessioned2023-12-29T07:55:16Z
dc.date.available2023-12-29T07:55:16Z
dc.date.issued2009
dc.description.abstractIn this paper, it is shown that the graph obtained by overlapping the cycle Cm (m ? 3) and the complete bipartite graph K3,3 at an edge is uniquely determined by its chromatic polynomial.en_US
dc.description.natureFinalen_US
dc.identifier.epage126
dc.identifier.scopus2-s2.0-78651554570
dc.identifier.spage117
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78651554570&partnerID=40&md5=65208e86684aff61b068bf9c98d41708
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30885
dc.identifier.volume70
dc.pagecount9
dc.sourceScopus
dc.sourcetitleJournal of Combinatorial Mathematics and Combinatorial Computing
dc.subjectChromatic polynomials
dc.subjectChromatic uniqueness
dc.subjectComplete bipartite graphs
dc.subjectGraph theory
dc.titleA result on chromatic uniqueness of edge-gluing of graphsen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS