Dominating circuits in regular matroids
From MaRDI portal
Publication:395251
DOI10.1016/j.aam.2013.10.001zbMath1281.05043OpenAlexW2015119735MaRDI QIDQ395251
Publication date: 29 January 2014
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2013.10.001
Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- A conjecture of Welsh revisited
- Circuits and cocircuits in regular matroids
- On the circuit-cocircuit intersection conjecture
- Ore-type and Dirac-type theorems for matroids
- Decomposition of regular matroids
- Large circuits in binary matroids of large cogirth. II
- Matroids with the circuit cover property
- Cycle cover ratio of regular matroids
- Unavoidable parallel minors of regular matroids
- Circuits through cocircuits in a graph with extensions to matroids
- Removable Circuits in Binary Matroids
- Some Theorems on Abstract Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dominating circuits in regular matroids