On the higher-order edge toughness of a graph

DOI10.1016/0012-365X(93)90147-LzbMath0789.05086MaRDI QIDQ686452

Juan-Miguel Gracia

Publication date: 24 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning forestsedge toughness

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items

Extensions of matroid covering and packing, Edge-disjoint spanning trees and eigenvalues of regular graphs, Spanning trees: A survey, Packing branchings under cardinality constraints on their root sets, On edge-rupture degree of graphs, Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid, Edge-disjoint spanning trees and forests of graphs, Edge-connectivity and edge-disjoint spanning trees

Cites Work

• Unnamed Item
• On the edge-toughness of a graph. I
• Tough graphs and Hamiltonian circuits.
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests