DC Field | Value | Language |
---|---|---|
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2013-03-07T02:35:34Z | - |
dc.date.available | 2013-03-07T02:35:34Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-03 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.57, no.3, pp.239 - 244 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/89218 | - |
dc.description.abstract | We prove that the rank-width of the incidence graph of a graph G is either equal to or exactly one less than the branch-width of G, unless the maximum degree of G is 0 or 1. This implies that rank-width of a graph is less than or equal to branch-width of the graph unless the branch-width is 0. Moreover, this inequality is tight. (C) 2007 Wiley Periodicals, Inc. | - |
dc.language | English | - |
dc.publisher | JOHN WILEY SONS INC | - |
dc.subject | CLIQUE-WIDTH | - |
dc.subject | MINORS | - |
dc.subject | GRAPHS | - |
dc.title | Rank-width is less than or equal to branch-width | - |
dc.type | Article | - |
dc.identifier.wosid | 000253170000004 | - |
dc.identifier.scopusid | 2-s2.0-40049109944 | - |
dc.type.rims | ART | - |
dc.citation.volume | 57 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 239 | - |
dc.citation.endingpage | 244 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.20280 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | rank-width | - |
dc.subject.keywordAuthor | branch-width | - |
dc.subject.keywordAuthor | tree-width | - |
dc.subject.keywordAuthor | clique-width | - |
dc.subject.keywordAuthor | line graphs | - |
dc.subject.keywordAuthor | incidence graphs | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | MINORS | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.