Closure property of contraction-depth of matroids

DOI10.1016/J.JCTB.2025.07.006MaRDI QIDQ6930168zbMATH OpenFDO

Authors Marcin Briański, Daniel Král', Ander Lamaison

Publication date 16 September 2025

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2025.07.006

zbMATH Keywords

contraction-depthdepth parametersmatroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40)

Cites work

• Branch-depth: generalizing tree-depth of graphs
• Branch-width, parse trees, and monadic second-order logic for matroids.
• Branchwidth of graphic matroids
• Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming
• Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
• Clustered colouring of graph classes with bounded treedepth or pathwidth
• Deciding first order properties of matroids
• Finding Branch-Decompositions and Rank-Decompositions
• Finding Branch-Decompositions and Rank-Decompositions
• Finding branch-decompositions of matroids, hypergraphs, and more
• First order convergence of matroids
• Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
• scientific article; zbMATH DE number 1962824 (Why is no real title available?)
• scientific article; zbMATH DE number 3451986 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 7788388 (Why is no real title available?)
• Improved bounds for the excluded-minor approximation of treedepth
• Mathematical Foundations of Computer Science 2003
• Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
• Matrices of optimal tree-depth and row-invariant parameterized algorithm for integer programming
• On space efficiency of algorithms working on structural decompositions of graphs
• On the power of tree-depth for fully polynomial FPT algorithms
• Sparsity. Graphs, structures, and algorithms
• The branchwidth of graphs and their cycle matroids
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
• Tight bound on treedepth in terms of pathwidth and longest path
• Tree-Depth and the Formula Complexity of Subgraph Isomorphism
• Treedepth vs circumference

This page was built for publication: Closure property of contraction-depth of matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930168)