Polynomial time recognition of uniform cocircuit graphs

DOI10.1016/J.ENDM.2009.11.006MaRDI QIDQ2840512zbMATH OpenOpenAlexFDO

Authors Ricardo Gómez Aiza, Juan José Montellano-Ballesteros, Ricardo Strausz, Kolja Knauer

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.006

zbMATH Keywords

cocircuit graphoriented matroidpolynomial algorithmrecognition algorithm

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Cubic time recognition of cocircuit graphs of uniform oriented matroids
• Generation of oriented matroids --- a graph theoretical approach
• Cocircuit graphs and efficient orientation reconstruction in oriented matroids
• scientific article; zbMATH DE number 3933116
• A characterization of cocircuit graphs of uniform oriented matroids

Cites work

• A characterization of cocircuit graphs of uniform oriented matroids
• A note on two problems in connexion with graphs
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 53152 (Why is no real title available?)
• On the cocircuit graph of an oriented matroid
• Oriented matroids

Cited in

(3)

• Disconnected coverings for oriented matroids via simultaneous mutations
• Polynomial time recognition of unit circular-arc graphs
• Cubic time recognition of cocircuit graphs of uniform oriented matroids

This page was built for publication: Polynomial time recognition of uniform cocircuit graphs

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