scientific article; zbMATH DE number 969101

zbMATH Open0863.05046MaRDI QIDQ5284569FDOQ5284569

Hong-Jian Lai, Zhi-Hong Chen

Publication date: 22 January 1997

Title of this publication is not available (Why is that?)

zbMATH Keywords

matroidsedge toughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (8)

• Packing branchings under cardinality constraints on their root sets
• On the higher-order edge toughness of a graph
• Spanning trees: A survey
• Extensions of matroid covering and packing
• Every matroid is a submatroid of a uniformly dense matroid
• Edge-connectivity and edge-disjoint spanning trees
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• A note on the edge-toughness of a class of graphs

   Recommendations

• On the higher-order edge toughness of a graph 👍 👎
• On the edge‐toughness of a graph. II 👍 👎
• On the edge-toughness of a graph. I 👍 👎

This page was built for publication:

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