DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hlineny, Petr | ko |
dc.contributor.author | Kwon, O-Joung | ko |
dc.contributor.author | Obdrzalek, Jan | ko |
dc.contributor.author | Ordyniak, Sebastian | ko |
dc.date.accessioned | 2016-07-07T04:53:58Z | - |
dc.date.available | 2016-07-07T04:53:58Z | - |
dc.date.created | 2016-06-13 | - |
dc.date.created | 2016-06-13 | - |
dc.date.issued | 2016-08 | - |
dc.identifier.citation | EUROPEAN JOURNAL OF COMBINATORICS, v.56, pp.46 - 56 | - |
dc.identifier.issn | 0195-6698 | - |
dc.identifier.uri | http://hdl.handle.net/10203/209711 | - |
dc.description.abstract | In a recent paper Kwon and Oum (2014), Kwon and Oum claim that every graph of bounded rank-width is a pivot-minor of a graph of bounded tree-width (while the converse has been known true already before). We study the analogous questions for "depth" parameters of graphs, namely for the tree-depth and related new shrub-depth. We show how a suitable adaptation of known results implies that shrub-depth is monotone under taking vertex-minors, and we prove that every graph class of bounded shrub-depth can be obtained via vertex-minors of graphs of bounded tree-depth. While we exhibit an example that pivot-minors are generally not sufficient (unlike Kwon and Oum (2014)) in the latter statement, we then prove that the bipartite graphs in every class of bounded shrub-depth can be obtained as pivot-minors of graphs of bounded tree-depth. (C) 2016 Elsevier Ltd. All rights reserved | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS LTD- ELSEVIER SCIENCE LTD | - |
dc.subject | CLIQUE-WIDTH | - |
dc.subject | RANK-WIDTH | - |
dc.subject | GRAPHS | - |
dc.title | Tree-depth and vertex-minors | - |
dc.type | Article | - |
dc.identifier.wosid | 000376056600004 | - |
dc.identifier.scopusid | 2-s2.0-84962562039 | - |
dc.type.rims | ART | - |
dc.citation.volume | 56 | - |
dc.citation.beginningpage | 46 | - |
dc.citation.endingpage | 56 | - |
dc.citation.publicationname | EUROPEAN JOURNAL OF COMBINATORICS | - |
dc.identifier.doi | 10.1016/j.ejc.2016.03.001 | - |
dc.contributor.nonIdAuthor | Hlineny, Petr | - |
dc.contributor.nonIdAuthor | Obdrzalek, Jan | - |
dc.contributor.nonIdAuthor | Ordyniak, Sebastian | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | CLIQUE-WIDTH | - |
dc.subject.keywordPlus | RANK-WIDTH | - |
dc.subject.keywordPlus | GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.