The graphicity of the union of graphic matroids

DOI10.1016/J.EJC.2015.03.022zbMATH Open1319.05028OpenAlexW614097938MaRDI QIDQ491733FDOQ491733

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

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

zbMATH Keywords

addends

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Matroid theory and its applications in electric network theory and in statics
• Matroids -- the engineers' revenge
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)