Show simple item record

dc.contributor.authorOh, Suho
dc.contributor.authorYoo, Hwanchul
dc.contributor.authorYun, Taedong
dc.date.accessioned2013-09-09T18:02:38Z
dc.date.available2013-09-09T18:02:38Z
dc.date.issued2013-06
dc.date.submitted2011-11
dc.identifier.issn0895-4801
dc.identifier.issn1095-7146
dc.identifier.urihttp://hdl.handle.net/1721.1/80376
dc.description.abstractA rainbow graph is a graph that admits a vertex-coloring such that every color appears exactly once in the neighborhood of each vertex. We investigate some properties of rainbow graphs. In particular, we show that there is a bijection between the isomorphism classes of n-rainbow graphs on 2n vertices and the switching classes of graphs on n vertices.en_US
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1137/110855089en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSIAMen_US
dc.titleRainbow Graphs and Switching Classesen_US
dc.typeArticleen_US
dc.identifier.citationOh, Suho, Hwanchul Yoo, and Taedong Yun. “Rainbow Graphs and Switching Classes.” SIAM Journal on Discrete Mathematics 27, no. 2 (April 4, 2013): 1106-1111. © 2013, Society for Industrial and Applied Mathematicsen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematicsen_US
dc.contributor.mitauthorYun, Taedongen_US
dc.relation.journalSIAM Journal on Discrete Mathematicsen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsOh, Suho; Yoo, Hwanchul; Yun, Taedongen_US
mit.licensePUBLISHER_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record