Branch-depth: generalizing tree-depth of graphs (Q2225398): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Asymptotically optimal induced universal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs and well‐quasi‐ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Wk- or K3,t-Minors in 3-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree-partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On infinite antichains of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unavoidable minors of graphs of large type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid <i>T</i>‐Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The branchwidth of graphs and their cycle matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering by Divisibility in Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width, parse trees, and monadic second-order logic for matroids. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Branch-Decompositions and Rank-Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding branch-decompositions of matroids, hypergraphs, and more / rank
 
Normal rank
Property / cites work
 
Property / cites work: First order convergence of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sharp bound on the size of a connected matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5421816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank‐width is less than or equal to branch‐width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank
 
Normal rank

Revision as of 12:25, 24 July 2024

scientific article
Language Label Description Also known as
English
Branch-depth: generalizing tree-depth of graphs
scientific article

    Statements

    Branch-depth: generalizing tree-depth of graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    branch-depth of a connectivity function
    0 references
    bounded tree-depth
    0 references
    matroids
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references