Paths in circuit graphs of matroids
From MaRDI portal
Recommendations
Cites work
- A lower bound on connectivities of matroid base graphs
- Cycles in circuit graphs of matroids
- Extremal critically connected matroids
- Graph theory
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- Matroid basis graphs. I
- Matroid basis graphs. II
- Pancyclic graphs. II
- Paths and cycles in matroid base graphs
- The connectivity of the basis graph of a branching greedoid
Cited in
(16)- On consistent families of circuits
- Paths on polymatroids
- Cycle lengths and circuit matroids of graphs
- Chords and disjoint paths in matroids
- Largest circuits in matroids
- The connectivity and diameter of second order circuit graphs of matroids
- Nowhere-zero 3-flows in matroid base graph
- Characterizations of matroids with an element lying in a restricted number of circuits
- Hamilton cycles in circuit graphs of matroids
- NOTE ON THE LENGTH OF ELEMENTARY CYCLES OF A GRAPH
- Properties of Hamilton cycles of circuit graphs of matroids
- scientific article; zbMATH DE number 11993 (Why is no real title available?)
- Balanced generic circuits without long paths
- Multi-Path Matroids
- Paths and cycles in matroid base graphs
- Paths and circuits in g-graphs
This page was built for publication: Paths in circuit graphs of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924155)