Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid

DOI10.1016/j.dam.2012.07.011zbMath1251.05028OpenAlexW2140544491MaRDI QIDQ714036

Ping Li, Yanting Liang, Hong-Jian Lai

Publication date: 19 October 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.07.011

zbMATH Keywords

strengthpolynomial algorithmedge-disjoint spanning treesfractional arboricitydisjoint basesspanning tree packing numbers

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (8)

Supereulerian regular matroids without small cocircuits ⋮ Chvátal-Erdős conditions and almost spanning trails ⋮ Degree sequences and graphs with disjoint spanning trees ⋮ Characterizations of strength extremal graphs ⋮ Collapsible subgraphs of a 4-edge-connected graph ⋮ On the extended Clark-Wormold Hamiltonian-like index problem ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Degree sequence realizations with given packing and covering of spanning trees

Cites Work

• Balanced and 1-balanced graph constructions
• On the higher-order edge toughness of a graph
• Transforming a graph into a 1-balanced graph
• Edge-connectivity and edge-disjoint spanning trees
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Connectivity and edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Optimal attack and reinforcement of a network
• Strongly balanced graphs and random graphs
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• On the spanning tree packing number of a graph: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid