Large circuits in binary matroids of large cogirth. I
From MaRDI portal
Publication:1127871
zbMATH Open0904.05023MaRDI QIDQ1127871FDOQ1127871
Authors: Winfried. Hochstättler, Bill Jackson 
Publication date: 14 December 1998
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Recommendations
Eulerian and Hamiltonian graphs (05C45) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Decomposition of regular matroids
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- Some Theorems on Abstract Graphs
- Title not available (Why is that?)
- A simple theorem on 3-connectivity
- Title not available (Why is that?)
- Large circuits in binary matroids of large cogirth. II
- Short cocircuits in binary matroids
Cited In (15)
- Dominating circuits in regular matroids
- Circuits and cocircuits in regular matroids
- On pancyclic representable matroids
- Ore-type and Dirac-type theorems for matroids
- Large circuits in binary matroids of large cogirth. II
- Peripheral circuits in infinite binary matroids
- Every matroid is a submatroid of a uniformly dense matroid
- Spanning cycles in regular matroids without small cocircuits
- Bounds of characteristic polynomials of regular matroids
- Disjoint cocircuits in matroids with large rank
- Supereulerian regular matroids without small cocircuits
- On large circuits in matroids
- Circuit preserving edge maps. II
- Largest circuits in matroids
- Title not available (Why is that?)
This page was built for publication: Large circuits in binary matroids of large cogirth. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127871)
