Displaying blocking pairs in signed graphs

DOI10.1016/j.ejc.2015.04.005zbMath1321.05102OpenAlexW920035815MaRDI QIDQ499457

Paul Wollan, Guenin, Bertrand, Irene Pivotto

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2015.04.005

zbMATH Keywords

even cycle matroids

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Related Items (1)

Recognizing pinch-graphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabilizer theorems for even cycle matroids
• Confinement of matroid representations to subsets of partial fields
• Biased graphs. I: Bias, balance, and gains
• A new characterization of graphic matroids
• On Mighton's characterization of graphic matroids
• Decomposition of regular matroids
• Recognizing graphic matroids
• Biased graphs. II: The three matroids
• Packing odd circuits in Eulerian graphs
• The excluded minors for GF(4)-representable matroids
• A characterization of weakly bipartite graphs
• Über eine Eigenschaft der ebenen Komplexe
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Packing Odd Circuits
• 2-Isomorphic Graphs
• Relationships between Pairs of Representations of Signed Binary Matroids

This page was built for publication: Displaying blocking pairs in signed graphs