scientific article; zbMATH DE number 4121463

MaRDI QIDQ4734775zbMATH OpenFDO

Authors Arthur M. Hobbs

Publication date 1989

zbMATH Keywords

edge-connectivityedge-toughractional arboricity

Mathematics Subject Classification ID

Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fractional arboricity, strength, and principal partitions in graphs and matroids
• scientific article; zbMATH DE number 56092
• On the edge‐toughness of a graph. II
• On computing a conditional edge-connectivity of a graph
• A matroid approach to finding edge connectivity and packing arborescences

Cited in

(10)

• Transforming a graph into a 1-balanced graph
• On star and caterpillar arboricity
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Edge-disjoint spanning trees and the number of maximum state circles of a graph
• Strength and fractional arboricity of complementary graphs
• Fast approximation for computing the fractional arboricity and extraction of communities of a graph
• On some arboricities in planar graphs
• scientific article; zbMATH DE number 1743772 (Why is no real title available?)
• Cyclic ordering of edges without long acyclic subsequences
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid

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