Recognizing even-cycle and even-cut matroids
From MaRDI portal
Publication:6052071
DOI10.1007/s10107-023-01944-6zbMath1525.05068OpenAlexW4367050287MaRDI QIDQ6052071
Guenin, Bertrand, Cheolwon Heo
Publication date: 23 October 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10012/10407
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
Related Items (2)
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
- Discrete optimization I. Proceedings of the Advanced Research Institute on discrete optimization and systems applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, co-sponsored by IBM Canada and SIAM, Banff, Alta, and Vancouver, B.C., Canada, August 1977
- On the minor-minimal 3-connected matroids having a fixed minor.
- 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
- 2-Isomorphic Graphs
- On Tutt's Characterization of graphic matroids—a graphic proof
- Recognizing Even-Cycle and Even-Cut Matroids
- Connectivity in Matroids
- Lectures on matroids
- A Splitter Theorem for Internally 4‐Connected Binary Matroids
- Small separations in pinch-graphic matroids
- Recognizing pinch-graphic matroids
This page was built for publication: Recognizing even-cycle and even-cut matroids