On the reconstruction of the matching polynomial and the reconstruction conjecture.
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Farrell, E.J., Wahid, S.A. (1987)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Firdovsi Sharifov (2010)
RAIRO - Operations Research
Similarity:
We consider the maximum weight perfectly matchable subgraph problem on a bipartite graph with respect to given nonnegative weights of its edges. We show that has a perfect matching if and only if some vector indexed by the nodes in is a base of an extended polymatroid associated with a submodular function defined on the subsets of . The dual problem of the separation problem for the extended polymatroid is transformed to the special maximum flow problem on . In this paper, we give...
Martin Knor, Ľudovít Niepel, Ľubomír Šoltés (1993)
Mathematica Slovaca
Similarity:
Farrell, E.J. (1983)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Harary, Frank (2001)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Farrell, E.J. (1985)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Knor, M., Niepel, L., Olts, L. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Bachl, S., Brandenburg, F.-J., Gmach, D. (2004)
Journal of Graph Algorithms and Applications
Similarity:
Farrell, E.J., Whitehead, Earl Glen jun. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
G. Dirac (1953)
Fundamenta Mathematicae
Similarity: