Another proof of a theorem concerning detachments of graphs

DOI10.1016/S0195-6698(13)80090-XzbMath0769.05054MaRDI QIDQ1176032

C. St. J. A. Nash-Williams

Publication date: 25 June 1992

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

connectivitymatroidmin-max theoremdetachment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (2)

Submodular function minimization ⋮ Fractional latin squares, simplex algebras, and generalized quotients

Cites Work

• Connected Detachments of Graphs and Generalized Euler Trails
• Transversals and matroid partition
• Unnamed Item

This page was built for publication: Another proof of a theorem concerning detachments of graphs