On a matroid defined by ear-decompositions of graphs

DOI10.1007/BF01844849zbMath0858.05084OpenAlexW2023971701MaRDI QIDQ1924493

Zoltán Szigeti

Publication date: 11 March 1997

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01844849

zbMATH Keywords

matroidear-decompositions

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Related Items (1)

On generalizations of matching-covered graphs

Cites Work

• Conservative weightings and ear-decompositions of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On a matroid defined by ear-decompositions of graphs