Obstructions for bounded shrub-depth and rank-depth
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kwon, O jung | - |
dc.contributor.author | McCarty, Rose | - |
dc.contributor.author | Oum, Sang-il | - |
dc.contributor.author | Wollan, Paul | - |
dc.date.accessioned | 2023-09-04T07:15:23Z | - |
dc.date.available | 2023-09-04T07:15:23Z | - |
dc.date.created | 2023-07-21 | - |
dc.date.issued | 2021-07 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189705 | - |
dc.description.abstract | Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth, which was conjectured by Hlineny et al. (2016) [11]. Namely, we prove that a graph has large rank-depth if and only if it has a vertex-minor isomorphic to a long path. This implies that for every integer t, the class of graphs with no vertex-minor isomorphic to the path on t vertices has bounded shrub-depth. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | Obstructions for bounded shrub-depth and rank-depth | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O jung | - |
dc.identifier.doi | 10.1016/j.jctb.2021.01.005 | - |
dc.identifier.scopusid | 2-s2.0-85099798845 | - |
dc.identifier.wosid | 000642463700005 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.149, pp.76 - 91 | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.title | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.volume | 149 | - |
dc.citation.startPage | 76 | - |
dc.citation.endPage | 91 | - |
dc.type.rims | ART | - |
dc.type.docType | 정기학술지(Article(Perspective Article포함)) | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.subject.keywordPlus | TREE-DEPTH | - |
dc.subject.keywordPlus | VERTEX-MINORS | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.subject.keywordAuthor | Shrub-depth | - |
dc.subject.keywordAuthor | Rank-depth | - |
dc.subject.keywordAuthor | Vertex-minor | - |
dc.subject.keywordAuthor | Pivot-minor | - |
dc.subject.keywordAuthor | Path | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0095895621000058?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.