Recognizing pinch-graphic matroids

DOI10.1007/s10107-023-01951-7OpenAlexW4366465856MaRDI QIDQ6120838

Guenin, Bertrand, Cheolwon Heo

Publication date: 21 February 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-023-01951-7

zbMATH Keywords

complexityalgorithmsbinary matroidssigned-graphseven-cycle matroids

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items

Recognizing even-cycle and even-cut matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Displaying blocking pairs in signed graphs
• A chain theorem for 4-connected matroids
• A chain theorem for internally 4-connected binary matroids
• Decomposition of regular matroids
• Generating weakly 4-connected matroids
• On the notion of balance of a signed graph
• Matroids and Graphs
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• On Tutte's Characterization of Graphic Matroids
• Recognizing Even-Cycle and Even-Cut Matroids
• A Splitter Theorem for Internally 4‐Connected Binary Matroids
• Recognizing even-cycle and even-cut matroids