Equivalence-free exhaustive generation of matroid representations

DOI10.1016/j.dam.2005.12.001zbMath1090.05012OpenAlexW2127349477MaRDI QIDQ2495901

Petr Hliněný

Publication date: 30 June 2006

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

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

zbMATH Keywords

canonical construction pathmatroid extension

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Uses Software

• MACEK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On internally 4-connected non-regular binary matroids
• On the excluded minors for matroids of branch-width three
• Decomposition of regular matroids
• Partial fields and matroid representation
• Isomorph-Free Exhaustive Generation
• Connectivity in Matroids

This page was built for publication: Equivalence-free exhaustive generation of matroid representations