DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwon, O-joung | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2021-01-28T05:50:47Z | - |
dc.date.available | 2021-01-28T05:50:47Z | - |
dc.date.created | 2020-10-06 | - |
dc.date.issued | 2021-03 | - |
dc.identifier.citation | JOURNAL OF GRAPH THEORY, v.96, no.3, pp.361 - 378 | - |
dc.identifier.issn | 0364-9024 | - |
dc.identifier.uri | http://hdl.handle.net/10203/279999 | - |
dc.description.abstract | We characterize classes of graphs closed under taking vertex-minors and having noPnand no disjoint union ofncopies of the 1-subdivision ofK1,nfor somen. Our characterization is described in terms of a tree of radius 2 whose leaves are labeled by the vertices of a graphG, and the width is measured by the maximum possible cut-rank of a partition ofV(G)induced by splitting an internal node of the tree to make two components. The minimum width possible is called the depth-2 rank-brittleness ofG. We prove that for alln, every graph with sufficiently large depth-2 rank-brittleness containsPnor disjoint union ofncopies of the 1-subdivision ofK1,nas a vertex-minor. | - |
dc.language | English | - |
dc.publisher | WILEY | - |
dc.title | Graphs of bounded depth-2 rank-brittleness | - |
dc.type | Article | - |
dc.identifier.wosid | 000569025400001 | - |
dc.identifier.scopusid | 2-s2.0-85091026316 | - |
dc.type.rims | ART | - |
dc.citation.volume | 96 | - |
dc.citation.issue | 3 | - |
dc.citation.beginningpage | 361 | - |
dc.citation.endingpage | 378 | - |
dc.citation.publicationname | JOURNAL OF GRAPH THEORY | - |
dc.identifier.doi | 10.1002/jgt.22619 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Kwon, O-joung | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | depth-rrank-brittleness | - |
dc.subject.keywordAuthor | path | - |
dc.subject.keywordAuthor | rank-depth | - |
dc.subject.keywordAuthor | vertex-minor | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | VERTEX-MINORS | - |
dc.subject.keywordPlus | TREE-DEPTH | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.