Recognizing Even-Cycle and Even-Cut Matroids

DOI10.1007/978-3-030-45771-6_15zbMath1504.05052OpenAlexW2409819057MaRDI QIDQ5041745

Cheolwon Heo, Guenin, Bertrand

Publication date: 14 October 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45771-6_15

zbMATH Keywords

complexitybinary matroidssigned graphs

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Signed and weighted graphs (05C22)

Related Items

Recognizing even-cycle and even-cut matroids, Small separations in pinch-graphic matroids, Recognizing pinch-graphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabilizer theorems for even cycle matroids
• Decomposition of regular matroids
• Recognizing graphic matroids
• Biased graphs. II: The three matroids
• On the minor-minimal 3-connected matroids having a fixed minor.
• On the notion of balance of a signed graph
• Matroid Intersection
• Matroids and Graphs
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• 2-Isomorphic Graphs
• Connectivity in Matroids
• Lectures on matroids
• A Splitter Theorem for Internally 4‐Connected Binary Matroids