A Menger-like property of tree-cut width
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Giannopoulou, Archontia C. | - |
dc.contributor.author | Kwon, O jung | - |
dc.contributor.author | Raymond, Jean-Florent | - |
dc.contributor.author | Thilikos, Dimitrios M. | - |
dc.date.accessioned | 2023-09-04T07:15:17Z | - |
dc.date.available | 2023-09-04T07:15:17Z | - |
dc.date.created | 2023-07-21 | - |
dc.date.issued | 2021-05 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189704 | - |
dc.description.abstract | In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness. This result had many uses and has been extended to several other decompositions. In this paper, we consider tree-cut decompositions, that have been introduced by Wollan (2015) as a possible edge-version of tree decompositions. We show that every graph admits a tree-cut decomposition of minimum width that additionally satisfies an edge-connectivity condition analogous to Thomas' leanness. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | A Menger-like property of tree-cut width | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kwon, O jung | - |
dc.identifier.doi | 10.1016/j.jctb.2020.12.005 | - |
dc.identifier.scopusid | 2-s2.0-85098048141 | - |
dc.identifier.wosid | 000624939200001 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.148, pp.1 - 22 | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.title | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.volume | 148 | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 22 | - |
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.keywordAuthor | Tree-cut width | - |
dc.subject.keywordAuthor | Graph immersions | - |
dc.subject.keywordAuthor | Lean decompositions | - |
dc.subject.keywordAuthor | Linked decompositions | - |
dc.subject.keywordAuthor | Connectivity | - |
dc.subject.keywordAuthor | Edge-disjoint paths | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0095895620301167?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.