Pairs of largest circuits in 3-connected matroids

DOI10.1016/J.LAA.2007.07.022zbMATH Open1125.05026OpenAlexW2001102048MaRDI QIDQ2459975FDOQ2459975

Authors: Manoel Lemos, Talmage James Reid, Bryan Williams, Haidong Wu 

Publication date: 9 November 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.07.022

Recommendations

• Largest circuits in matroids
• Maximum size circuit Pairs in matroids
• Intersections of largest bonds in \(k\)-connected graphs
• On large circuits in matroids
• Circuits through cocircuits in a graph with extensions to matroids

zbMATH Keywords

circuitcircumferencematroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Decomposition of regular matroids
• Title not available (Why is that?)
• A polynomial algorithm for the max-cut problem on graphs without long odd cycles
• On infinite antichains of matroids
• Largest circuits in matroids
• Title not available (Why is that?)

Cited In (4)

• On deletions of largest bonds in graphs
• Maximum size circuit Pairs in matroids
• How big can the circuits of a bridge of a maximal circuit be?
• Largest circuits in matroids

This page was built for publication: Pairs of largest circuits in 3-connected matroids

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