scientific article; zbMATH DE number 969101

MaRDI QIDQ5284569zbMATH OpenFDO

Authors Zhi-Hong Chen, Hong-Jian Lai

Publication date 22 January 1997

zbMATH Keywords

matroidsedge toughness

Mathematics Subject Classification ID

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

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

Cited in

(8)

• Extensions of matroid covering and packing
• On the higher-order edge toughness of a graph
• 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
• Every matroid is a submatroid of a uniformly dense matroid
• Edge-connectivity and edge-disjoint spanning trees
• Packing branchings under cardinality constraints on their root sets
• Spanning trees: A survey

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)