A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...
Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback