Small separations in pinch-graphic matroids

DOI10.1007/s10107-023-01950-8OpenAlexW4366371563MaRDI QIDQ6120837

Cheolwon Heo, Guenin, Bertrand

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-01950-8

zbMATH Keywords

complexityalgorithmsbinary matroidsgraftssigned-graphs

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (1)

Recognizing even-cycle and even-cut matroids

Cites Work

• Stabilizer theorems for even cycle matroids
• The structure of the 3-separations of 3-connected matroids
• Decomposition of regular matroids
• Recognizing graphic matroids
• On the notion of balance of a signed graph
• A short proof of Shih's isomorphism theorem on graphic subspaces
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• 2-Isomorphic Graphs
• Recognizing Even-Cycle and Even-Cut Matroids
• Connectivity in Matroids
• A Splitter Theorem for Internally 4‐Connected Binary Matroids
• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Recognizing even-cycle and even-cut matroids

This page was built for publication: Small separations in pinch-graphic matroids