Pages that link to "Item:Q686452"
From MaRDI portal
The following pages link to On the higher-order edge toughness of a graph (Q686452):
Displaying 11 items.
- On the first-order edge tenacity of a graph (Q266912) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Edge-connectivity and edge-disjoint spanning trees (Q1011773) (← links)
- On the edge-toughness of a graph. I (Q1263604) (← links)
- Extensions of matroid covering and packing (Q1633609) (← links)
- On edge-rupture degree of graphs (Q1732840) (← links)
- Edge-disjoint spanning trees and forests of graphs (Q2028071) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- On the existence of balanced graphs with given egde-toughness and edge- connectivity (Q4014300) (← links)