Matroid union -- graphic? binary? neither?

DOI10.1016/J.DAM.2015.10.037MaRDI QIDQ298959zbMATH OpenOpenAlexFDO

Authors Csongor Gy. Csehi, András Recski

Publication date 21 June 2016

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

Full work available at URL https://doi.org/10.1016/j.dam.2015.10.037

zbMATH Keywords

graphic matroidmatroid theoryunion of matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• The graphicity of the union of graphic matroids
• A circuit characterization of graphic matroids
• A characterization of graphic matroids using non-separating cocircuits
• On binary reducibility
• scientific article; zbMATH DE number 3150

Cites work

• scientific article; zbMATH DE number 3959445 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3365295 (Why is no real title available?)
• Matroid theory and its applications in electric network theory and in statics
• Matroids -- the engineers' revenge
• On the sum of matroids
• The graphicity of the union of graphic matroids

Cited in

(5)

• scientific article; zbMATH DE number 3863214 (Why is no real title available?)
• How is a chordal graph like a supersolvable binary matroid?
• The graphicity of the union of graphic matroids
• Iterated parallel union of matroids
• On binary reducibility

This page was built for publication: Matroid union -- graphic? binary? neither?

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