Graphs of bounded depth-2 rank-brittleness

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 65
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKwon, O-joungko
dc.contributor.authorOum, Sang-ilko
dc.date.accessioned2021-01-28T05:50:47Z-
dc.date.available2021-01-28T05:50:47Z-
dc.date.created2020-10-06-
dc.date.issued2021-03-
dc.identifier.citationJOURNAL OF GRAPH THEORY, v.96, no.3, pp.361 - 378-
dc.identifier.issn0364-9024-
dc.identifier.urihttp://hdl.handle.net/10203/279999-
dc.description.abstractWe 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.languageEnglish-
dc.publisherWILEY-
dc.titleGraphs of bounded depth-2 rank-brittleness-
dc.typeArticle-
dc.identifier.wosid000569025400001-
dc.identifier.scopusid2-s2.0-85091026316-
dc.type.rimsART-
dc.citation.volume96-
dc.citation.issue3-
dc.citation.beginningpage361-
dc.citation.endingpage378-
dc.citation.publicationnameJOURNAL OF GRAPH THEORY-
dc.identifier.doi10.1002/jgt.22619-
dc.contributor.localauthorOum, Sang-il-
dc.contributor.nonIdAuthorKwon, O-joung-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthordepth-rrank-brittleness-
dc.subject.keywordAuthorpath-
dc.subject.keywordAuthorrank-depth-
dc.subject.keywordAuthorvertex-minor-
dc.subject.keywordPlusCLIQUE-WIDTH-
dc.subject.keywordPlusVERTEX-MINORS-
dc.subject.keywordPlusTREE-DEPTH-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0