We prove that a graph has large rank-depth if and only if it has a vertex-minor isomorphic to a long path.
Nov 1, 2019 · We prove that a graph has large rank-depth if and only if it has a vertex-minor isomorphic to a long path.
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 ...
Obstructions for bounded shrub-depth and rank-depth - NASA/ADS
ui.adsabs.harvard.edu › abs › 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 ...
Obstructions for bounded shrub-depth and rank-depth · O-joung Kwon, Rose McCarty, +1 author. Paul Wollan · Published in J. Comb. Theory B 1 November 2019 ...
Obstructions for bounded shrub-depth and rank-depth | Request PDF
www.researchgate.net › ... › Graphs
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 ...
Oct 27, 2020 · Abstract: Shrub-depth and rank-depth of graphs are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree- ...
Obstructions for bounded shrub-depth and rank-depth · List of references · Publications that cite this publication.
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 ...
Sep 12, 2024 · DeVos, Kwon, and Oum introduced the concept of branch-depth of matroids as a natural analogue of tree-depth of graphs.