Paths and cycles in matroid base graphs
From MaRDI portal
Redirect page
Redirect to:
Recommendations
Cites work
Cited in
(26)- Paths in circuit graphs of matroids
- Paths and cycles as tools for the characterization of some classes of matrices
- Brian Alspach and his work
- A lower bound on connectivities of matroid base graphs
- A note on certain de Bruijn sequences with forbidden subsequences
- NOTE ON THE LENGTH OF ELEMENTARY CYCLES OF A GRAPH
- On the matroidal path ideals
- Characterizations of matroids with an element lying in a restricted number of circuits
- On pancyclic representable matroids
- Counting Hamiltonian cycles in the matroid basis graph
- The P₃-Hamiltonian property of matroid base graphs
- Path coverings of graphs and height characteristics of matrices
- Hamilton cycles in matroid base graphs
- Chords and disjoint paths in matroids
- The connectivity and minimum degree of circuit graphs of matroids
- Cycles in circuit graphs of matroids
- Hamilton cycles in circuit graphs of matroids
- scientific article; zbMATH DE number 1475040 (Why is no real title available?)
- The spanning 3-connectivity of circuit graphs of matroids
- Multi-Path Matroids
- The connectivity and diameter of second order circuit graphs of matroids
- Determining the minimum rank of matroids whose basis graph is common
- scientific article; zbMATH DE number 2197947 (Why is no real title available?)
- Vertex disjoint cycles in intersection graphs of bases of matroids
- Edge disjoint Hamilton cycles in intersection graphs of bases of matroids
- Properties of Hamilton cycles of circuit graphs of matroids
This page was built for publication: Paths and cycles in matroid base graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583218)