Cycles in circuit graphs of matroids

DOI10.1007/S00373-007-0739-7zbMATH Open1124.05021OpenAlexW2075859788MaRDI QIDQ2385136FDOQ2385136

Guizhen Liu, Ping Li

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Tree Graph of a Matroid
• A lower bound on connectivities of matroid base graphs
• Pancyclic graphs. II
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• The connectivity of the basis graph of a branching greedoid
• Title not available (Why is that?)
• Paths and cycles in matroid base graphs
• Matroid basis graphs. I
• Matroid basis graphs. II
• Extremal critically connected matroids

Cited In (8)

• Paths in circuit graphs of matroids
• The connectivity and Hamiltonian properties of second-order circuit graphs of wheel cycle matroids
• Characterizations of matroids with an element lying in a restricted number of circuits
• 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)