Characterization of removable elements with respect to having k disjoint bases in a matroid
DOI10.1016/J.DAM.2012.07.011zbMATH Open1251.05028OpenAlexW2140544491MaRDI QIDQ714036FDOQ714036
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
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
polynomial algorithmedge-disjoint spanning treesfractional arboricitystrengthdisjoint basesspanning tree packing numbers
Trees (05C05) Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the higher-order edge toughness of a 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
- Strongly balanced graphs and random graphs
- Title not available (Why is that?)
- Optimal attack and reinforcement of a network
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- On the spanning tree packing number of a graph: A survey
- Connectivity and edge-disjoint spanning trees
- Title not available (Why is that?)
- Balanced and 1-balanced graph constructions
- Title not available (Why is that?)
- Transforming a graph into a 1-balanced graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Collapsible subgraphs of a 4-edge-connected graph
- 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
- Cyclic base ordering of generalized Petersen graphs
- Complete family reduction and spanning connectivity in line graphs
- Cyclic base ordering of certain degenerate 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)
