On the higher-order edge toughness of a graph

DOI10.1016/0012-365X(93)90147-LzbMATH Open0789.05086MaRDI QIDQ686452FDOQ686452

Juan-Miguel Gracia

Publication date: 24 May 1994

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

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

zbMATH Keywords

spanning forestsedge toughness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests
• Tough graphs and Hamiltonian circuits.
• On the edge-toughness of a graph. I

Cited In (12)

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

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)