DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwon, O-joung | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2020-07-28T02:55:28Z | - |
dc.date.available | 2020-07-28T02:55:28Z | - |
dc.date.created | 2020-06-09 | - |
dc.date.created | 2020-06-09 | - |
dc.date.created | 2020-06-09 | - |
dc.date.issued | 2020-01 | - |
dc.identifier.citation | SIAM JOURNAL ON DISCRETE MATHEMATICS, v.34, no.1, pp.972 - 999 | - |
dc.identifier.issn | 0895-4801 | - |
dc.identifier.uri | http://hdl.handle.net/10203/275658 | - |
dc.description.abstract | For a class C of graphs G equipped with functions f(G) defined on subsets of E(G) or V (G), we say that C is k-scattered with respect to f(G) if there exists a constant .e such that for every graph G is an element of C, the domain of f(G) can be partitioned into subsets of size at most k so that the union of every collection of the subsets has f(G) value at most We present structural characterizations of graph classes that are k-scattered with respect to several graph connectivity functions. In particular, our theorem for cut-rank functions provides a rough structural characterization of graphs having no mK(1,n) vertex-minor, which allows us to prove that such graphs have bounded linear rank-width. | - |
dc.language | English | - |
dc.publisher | SIAM PUBLICATIONS | - |
dc.title | Scattered Classes of Graphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000546886700046 | - |
dc.identifier.scopusid | 2-s2.0-85090699650 | - |
dc.type.rims | ART | - |
dc.citation.volume | 34 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 972 | - |
dc.citation.endingpage | 999 | - |
dc.citation.publicationname | SIAM JOURNAL ON DISCRETE MATHEMATICS | - |
dc.identifier.doi | 10.1137/19m1293776 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Kwon, O-joung | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | graph structure | - |
dc.subject.keywordAuthor | vertex-minor | - |
dc.subject.keywordAuthor | subgraph | - |
dc.subject.keywordPlus | LINEAR RANK-WIDTH | - |
dc.subject.keywordPlus | VERTEX-MINORS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.