Polak, A.; Simson, D.
(Algebra and Discrete Mathematics, 2013)
We present combinatorial algorithms constructing loop-free P-critical edge-bipartite (signed) graphs Δ′, with n ≥ 3 vertices, from pairs (Δ, w), with Δ a positive edge-bipartite graph having n-1 vertices and w a sincere ...