Cycles in circuit graphs of matroids

DOI10.1007/S00373-007-0739-7MaRDI QIDQ2385136zbMATH OpenOpenAlexFDO

Authors Ping Li, Guizhen Liu

Publication date 11 October 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0739-7

zbMATH Keywords

MatroidCircuit graph of matroidEdge-pancyclic

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 3472075 (Why is no real title available?)
• A lower bound on connectivities of matroid base graphs
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• Extremal critically connected matroids
• Graph theory with applications
• Matroid basis graphs. I
• Matroid basis graphs. II
• On the Tree Graph of a Matroid
• Pancyclic graphs. II
• Paths and cycles in matroid base graphs
• The connectivity of the basis graph of a branching greedoid

Cited in

(8)

• Paths in circuit graphs of matroids
• Characterizations of matroids with an element lying in a restricted number of circuits
• The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
• The connectivity and diameter of second order circuit graphs of matroids
• Recognizing Even-Cycle and Even-Cut Matroids
• Vertex disjoint cycles in intersection graphs of bases of matroids
• Properties of Hamilton cycles of circuit graphs of matroids
• Tutte cycles in circuit graphs

This page was built for publication: Cycles in circuit graphs of matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385136)