The graphicity of the union of graphic matroids

DOI10.1016/J.EJC.2015.03.022MaRDI QIDQ491733zbMATH OpenOpenAlexFDO

Authors Csongor Gy. Csehi, András Recski

Publication date 19 August 2015

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

Full work available at URL https://doi.org/10.1016/j.ejc.2015.03.022

zbMATH Keywords

addends

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Matroid union -- graphic? binary? neither?
• A circuit characterization of graphic matroids
• A new characterization of graphic matroids
• A characterization of graphic matroids using non-separating cocircuits
• A characterization of graphic matroids based on circuit orderings

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

Cited in

(4)

• A circuit characterization of graphic matroids
• Matroid union -- graphic? binary? neither?
• New approaches to the graphicness of a matroid
• scientific article; zbMATH DE number 3995706 (Why is no real title available?)

This page was built for publication: The graphicity of the union of graphic matroids

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