Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Polynomial Time Recognition of Uniform Cocircuit Graphs

From MaRDI portal
Publication:2840512
Jump to:navigation, search

DOI10.1016/j.endm.2009.11.006zbMath1268.05189OpenAlexW1991271795MaRDI QIDQ2840512

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

polynomial algorithmoriented matroidrecognition algorithmcocircuit graph


Mathematics Subject Classification ID

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




Cites Work

  • A note on two problems in connexion with graphs
  • Oriented matroids
  • On the cocircuit graph of an oriented matroid
  • A characterization of cocircuit graphs of uniform oriented matroids
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Polynomial Time Recognition of Uniform Cocircuit Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2840512&oldid=15765181"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki