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

DOI10.1016/J.DAM.2012.07.011MaRDI QIDQ714036zbMATH OpenOpenAlexFDO

Authors 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

polynomial algorithmedge-disjoint spanning treesfractional arboricitystrengthdisjoint 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)

Recommendations

• Characterizations of Disconnected Matroids
• Disjoint Bases for a Countable Family of Rank-Finite Matroids
• On Disjoint Common Bases in Two Matroids
• A characterization of the base-matroids of a graphic matroid
• On removable series classes in connected matroids
• scientific article; zbMATH DE number 842018
• A characterization of the bases of line-splitting matroids
• Determination of the bases of a splitting matroid
• Adjacency, inseparability, and base orderability in matroids
• On some properties of base-matroids

Cites work

• scientific article; zbMATH DE number 4130426 (Why is no real title available?)
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 36698 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 4121463 (Why is no real title available?)
• scientific article; zbMATH DE number 969101 (Why is no real title available?)
• scientific article; zbMATH DE number 2188414 (Why is no real title available?)
• Balanced and 1-balanced graph constructions
• Connectivity and edge-disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-connectivity and edge-disjoint spanning trees
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Graph theory
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• On the Problem of Decomposing a Graph into n Connected Factors
• On the higher-order edge toughness of a graph
• On the spanning tree packing number of a graph: A survey
• Optimal attack and reinforcement of a network
• Reinforcing the number of disjoint spanning trees
• Strongly balanced graphs and random graphs
• Transforming a graph into a 1-balanced graph

Cited in

(11)

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

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

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