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

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

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

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

ALGORITHMIC PROOFS OF TWO RELATIONS BETWEEN CONNECTIVITY AND THE 1-FACTORS OF A GRAPHGABOW HN.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 26; NO 1; PP. 33-40; BIBL. 7 REF.Article

RAMSEY NUMBERS FOR MATCHINGSFAUDREE RJ; SCHELP RH; SHEEHAN J et al.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 105-123; BIBL. 10 REF.Article

RANG DES COUPLAGES MAXIMUMS D'UN GRAPHE.NADDEF D.1978; ; S.L.; DA. 1978; PP. 1-62; BIBL. 7 REF.; (THESE DOCT. 3E CYCLE, MATH. APPL.; GRENOBLE)Thesis

NOTES SUR LE COUPLAGE DIRECT-COUPLAGE DANS LES COMBINAISONS.TREHEL M.1978; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1978; VOL. 20; NO 2; PP. 147-161; BIBL. 3 REF.Article

DEFECT-D MATCHINGS IN GRAPHS WITH CYCLOMATIC NUMBERS 0,1 AND 2FARRELL EJ.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 3; PP. 259-266; BIBL. 6 REF.Article

F-FACTORS, PERFECT MATCHINGS AND RELATED CONCEPTSDERIGS U.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 388-403; BIBL. 8 REF.Conference Paper

LOWER BOUNDS ON THE CARDINALITY OF THE MAXIMUM MATCHINGS OF PLANAR GRAPHSNISHIZEKI T.1979; DISCRETE MATH.; NLD; DA. 1979; VOL. 28; NO 3; PP. 255-267; BIBL. 12 REF.Article

REMARK ON MATCHINGS IN REGULAR GRAPHSPLESNIK J.1979; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; CSK; DA. 1979; VOL. 34; PP. 63-67; ABS. RUS; BIBL. 5 REF.Article

MATCHINGS AND SPANNING TREES IN BOOLEAN WEIGHTED GRAPHSBERMAN KA.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 343-350; BIBL. 4 REF.Article

MAXIMUM MATCHINGS IN SPARSE RANDOM GRAPHSKARP RM; SIPSER M.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 364-375; BIBL. 3 REF.Conference Paper

PARTITIONING TREES: MATCHING, DOMINATION, AND MAXIMUM DIAMETERFARLEY A; HEDETNIEMI S; PROSKUROWSKI A et al.1981; INT. J. COMPUT. INF. SCI.; ISSN 0091-7036; USA; DA. 1981; VOL. 10; NO 1; PP. 55-61; BIBL. 8 REF.Article

THE TRAVELING SALESMAN PROBLEM AND MINIMUM MATCHING IN THE UNIT SQUARESUPOWIT KJ; REINGOLD EM; PLAISTED DA et al.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 144-156; BIBL. 18 REF.Article

M-TRANSFORMATIONS. QUANTORISATION. COUPLAGES. INVARIANTS D'ISOMORPHISMEMALOV KM.1982; KIBERNETIKA; ISSN 506850; UKR; DA. 1982; NO 4; PP. 11-14; BIBL. 5 REF.Article

TESTING FOR EQUALITY BETWEEN MAXIMUM MATCHING AND MINIMUM NODE COVERING.GAVRIL F.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 199-202; BIBL. 5 REF.Article

AN NP-COMPLETE MATCHING PROBLEMPLAISTED DA; ZAKS S.1980; DISCRETE APPL. MATH.; NLD; DA. 1980; VOL. 2; NO 1; PP. 65-72; BIBL. 5 REF.Article

DES ALGORITHMES LINEAIRES POUR LES PROBLEMES DE PARTITION, DE RECOUVREMENT ET DE COUPLAGE DANS LES HYPERGRAPHES D'INTERVALLESGONDRAN M.1979; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1979; VOL. 13; NO 1; PP. 13-21; BIBL. 9 REF.Article