On the higher-order edge toughness of a graph

DOI10.1016/0012-365X(93)90147-LMaRDI QIDQ686452zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 969101
• On the edge‐toughness of a graph. II
• scientific article; zbMATH DE number 68345
• On the edge-toughness of a graph. I
• Edge-connectivity and edge-disjoint spanning trees

Cites work

• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Decomposition of Finite Graphs Into Forests
• Edge-Disjoint Spanning Trees of Finite Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On the edge-toughness of a graph. I
• Tough graphs and Hamiltonian circuits.

Cited in

(12)

• Extensions of matroid covering and packing
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• scientific article; zbMATH DE number 68345 (Why is no real title available?)
• On the edge‐toughness of a graph. II
• On the edge-toughness of a graph. I
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-disjoint spanning trees and forests of graphs
• On edge-rupture degree of graphs
• Edge-connectivity and edge-disjoint spanning trees
• On the first-order edge tenacity of a graph
• Packing branchings under cardinality constraints on their root sets
• Spanning trees: A survey

This page was built for publication: On the higher-order edge toughness of a graph

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