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

APPROXIMATION MAXIMALER MATCHINGS = APPROXIMATION DE COUPLAGES MAXIMAUXMEISTERERNST R; SCHMIDT FJ.1982; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1982; VOL. 18; NO 4-5; PP. 205-215; ABS. ENG/RUS; BIBL. 8 REF.Article

COUPLAGES ET TRANSVERSAUX GENERALISES D'UN HYPERGRAPHE INFINIPOLAT N.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 3; PP. 293-315; ABS. ENG; BIBL. 9 REF.Article

SENSITIVITY ANALYSIS OF OPTIMAL MATCHINGSWEBER GM.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 41-56; BIBL. 6 REF.Article

A CHARACTERIZATION OF THE GRAPHS IN WHICH THE TRANSVERSAL NUMBER EQUALS THE MATCHING NUMBERSTERBOUL F.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 2; PP. 228-229; BIBL. 2 REF.Article

A SIMPLE ALGORITHM FOR MAXIMUM MATCHING OF GRAPHSKNAUER B.1979; SER. INTERNATION. ANAL. NUMER.; CHE; DA. 1979; VOL. 46; PP. 184-194; BIBL. 2 REF.Conference Paper

COUPLAGES MAXIMAUX DISJOINTSPAYAN C.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 327-329; ABS. ENG; BIBL. 8 REF.Conference Paper

ON DEFECT-D MATCHINGS IN GRAPHS.LITTLE CHC; GRANT DD; HOLTON DA et al.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 1; PP. 41-54; BIBL. 9 REF.Article

MATCHING-PERFECT AND COVER-PERFECT GRAPHS.LEWIN M.1974; ISRAEL J. MATH.; ISRAEL; DA. 1974; VOL. 18; NO 4; PP. 345-347; BIBL. 2 REF.Article

MATCHING AND SPANNING IN CERTAIN PLANAR GRAPHSCARLYLE JW; GREIBACH SA; PAZ A et al.1983; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1983; VOL. 16; NO 2; PP. 159-183; BIBL. 17 REF.Article

THE EDMONDS-GALLAI DECOMPOSITION FOR MATCHINGS IN LOCALLY FINITE GRAPHSBRY F; LAS VERGNAS M.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 3; PP. 229-235; BIBL. 15 REF.Article

CHARACTERISTIC AND MATCHING POLYNOMIALS OF SOME COMPOUND GRAPHSGUTMAN I.1980; PUBL. INST. MATH. (BELGR.); ISSN 0350-1302; YUG; DA. 1980; VOL. 27; NO 41; PP. 61-66; BIBL. 6 REF.Article

GRAPHS WITH GREATEST NUMBER OF MATCHINGSGUTMAN I.1980; PUBL. INST. MATH. (BELGR.); ISSN 0350-1302; YUG; DA. 1980; VOL. 27; NO 41; PP. 67-76; BIBL. 11 REF.Article

(1, Q)-COMBINAISONSSUSHKOV YU A.1975; VEST. LENINGRAD. UNIV.; S.S.S.R.; DA. 1975; NO 19; PP. 50-55; ABS. ANGL.; BIBL. 4 REF.Article

PARTITIONS OF GRAPHS INTO COVERINGS AND HYPERGRAPHS INTO TRANSVERSALS.DE WERRA D.1974; COMMENT. MATH. HELV.; SUISSE; DA. 1974; VOL. 49; NO 2; PP. 175-178; BIBL. 4 REF.Article

ANALYSE DE LA STRUCTURE CYCLIQUE D'UNE MATRICE DE COUPLAGETROFIMOV VA.1974; IN: VOPR. ANAL. SLOZHNYKH SIST.; NOVOSIBIRSK; NAUKA; DA. 1974; PP. 77-83; BIBL. 11 REF.Book Chapter

MATCHING IN MODULAR LATTICESDUFUS D.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 32; NO 3; PP. 303-314; BIBL. 13 REF.Article

BRICK DECOMPOSITIONS AND THE MATCHING RANK OF GRAPHSEDMONDS J; LOVASZ L; PULLEYBLANK WR et al.1982; COMBINATORICA (BUDAPEST. 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 3; PP. 247-274; BIBL. 15 REF.Article

HEURISTICS FOR WEIGHTED PERFECT MATCHINGSUPOWIT KJ; PLAISTED DA; REINGOLD EM et al.1980; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 12/1980/LOS ANGELES CA; USA; NEW YORK: ACM; DA. 1980; PP. 398-419; BIBL. 14 REF.Conference Paper

ON THE RELATIONSHIP BETWEEN THE GENUS AND THE CARDINALITY OF THE MAXIMUM MATCHINGS OF A GRAPHNISHIZEKI J.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 2; PP. 149-156; BIBL. 9 REF.Article

SUR UN ALGORITHME DE RECHERCHE DES COMBINAISONS PAR PAIRES DANS LES GRAPHES FINISKORSHUNOV AD.1975; KIBERNETIKA, U.S.S.R.; S.S.S.R.; DA. 1975; NO 1; PP. 1-8; BIBL. 3 REF.Article

VU ALGORITHME PARALLELE ET ITERATIF POUR LE COUPLAGE DE GRAPHESUGIE N.1975; BULL. ELECTROTECH. LAB.; JAP.; DA. 1975; VOL. 39; NO 3; PP. 204-210; ABS. ANGL.; BIBL. 6 REF.Article

FACETS OF L-MATCHING POLYHEDRA.PULLEYBLANK W; EDMONDS J.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 214-242; BIBL. 5 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

SHORT PROOFS ON THE MATCHING POLYHEDRONSCHRIJVER A.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 1; PP. 104-108; BIBL. 9 REF.Article

EAR DECOMPOSITIONS OF ELEMENTARY GRAPHS AND GF₂-RANK OF PERFECT MATCHINGSNADDEF DJ; PULLEYBLANK WR.1982; NORTH-HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1982; NO 66; PP. 241-260; BIBL. 9 REF.Conference Paper