Approximate constrained subgraph matchingZAMPELLI, Stéphane; DEVILLE, Yves; DUPONT, Pierre et al.Lecture notes in computer science. 2005, pp 832-836, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

Matchings in graphs of size ℵAHARONI, R.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 113-117, issn 0095-8956Article

Matchings in pentagonal chainsFARRELL, E. J; WAHID, S. A.Discrete applied mathematics. 1984, Vol 8, Num 1, pp 31-40, issn 0166-218XArticle

On an obstruction for perfect matchingsAHARONI, R.Combinatorica (Print). 1984, Vol 4, Num 1, pp 1-6, issn 0209-9683Article

On certain classes of fractional matchingsMÜHLBACHER, J. R; STEINPARZ, F. X; TINHOFER, G et al.Discrete applied mathematics. 1984, Vol 9, Num 3, pp 235-244, issn 0166-218XArticle

k-Best constrained bases of a matroidLECLERC, M; RENDL, F.Zeitschrift für Operations Research. 1990, Vol 34, Num 2, pp 79-89, issn 0373-790X, 11 p.Article

Shape similarity in remote sensing images using graph matching techniques = Similitude de forme dans les images de télédétection à l'aide des techniques de couplage de graphesFERNANDEZ, S.International geoscience and remote sensing symposium. 1986, pp 1005-1009Conference Paper

Fractional matchings and covers in infinite hypergraphsAHARONI, R.Combinatorica (Print). 1985, Vol 5, Num 3, pp 181-184, issn 0209-9683Article

Slender graphsHERTZ, A.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 231-236, issn 0095-8956, 6 p.Article

An efficient algorithm for the bipartite matching problemCARRARESI, P; SODINI, C.European journal of operational research. 1986, Vol 23, Num 1, pp 86-93, issn 0377-2217Article

A polynomial algorithm for b-matchings: an alternative approachANSTEE, R. P.Information processing letters. 1987, Vol 24, Num 3, pp 153-157, issn 0020-0190Article

Ear-decompositions of matching-covered graphsLOVASZ, L.Combinatorica (Print). 1983, Vol 3, Num 1, pp 105-117, issn 0209-9683Article

On the theory of matching equivalent graphs and rook equivalent chessboardsFARRELL, E. J.Journal of the Franklin Institute. 1992, Vol 329, Num 1, pp 45-64, issn 0016-0032Article

Induced matchings in bipartite graphsFAUDREE, R. J; GYARFAS, A; SCHELP, R. H et al.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 83-87, issn 0012-365X, 5 p.Article

On operator and formal sum methods for graph enumeration problemsLIU, C. J; YUTZE CHOW.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 384-406, issn 0196-5212Article

LARGE MATCHINGS IN GRAPHS.WEINSTEIN J.1974; CANAD. J. MATH.; CANADA; DA. 1974; VOL. 26; NO 6; PP. 1498-1508; BIBL. 4 REF.Article

Computation of sparse circulant permanents via determinantsCODENOTTI, B; RESTA, G.Linear algebra and its applications. 2002, Vol 355, pp 15-34, issn 0024-3795Article

Approximating matchings in parallelFISCHER, T; GOLDBERG, A. V; HAGLIN, D. J et al.Information processing letters. 1993, Vol 46, Num 3, pp 115-118, issn 0020-0190Article

On matching coefficientsFARRELL, E. J; GUO, J. M; CONSTANTINE, G. M et al.Discrete mathematics. 1991, Vol 89, Num 2, pp 203-210, issn 0012-365XArticle

Maximum matchings in a class of random graphsFRIEZE, A. M.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 2, pp 196-212, issn 0095-8956Article

Implementation of O(nm log n) weighted matchings in general graphs. The power of data structuresMEHLHORN, Kurt; SCHÄFER, Guido.Lecture notes in computer science. 2001, pp 23-38, issn 0302-9743, isbn 3-540-42512-8Conference Paper

On separation and adjency problems for perfectly matchable subgraph polytopes of a graphNING QI.Operations research letters. 1987, Vol 6, Num 5, pp 239-241, issn 0167-6377Article

Classifying 2-extendable generalized Petersen graphsQINGLIN YU.Discrete mathematics. 1992, Vol 103, Num 2, pp 209-220, issn 0012-365XArticle

The 2-matching lattice of a graphJUNGNICKEL, D; LECLERC, M.Journal of combinatorial theory. Series B. 1989, Vol 46, Num 2, pp 246-248, issn 0095-8956Article

Minimum-maximal matching in series-parallel graphsRICHEY, M. B; PARKER, R. G.European journal of operational research. 1988, Vol 33, Num 1, pp 98-105, issn 0377-2217Article