A distance problem in graph theoryANDREATTA, A; SCOTTI, F.Rendiconti - Istituto lombardo. Accademia di scienze e lettere. A. Scienze matematiche e applicazioni. 1991, Vol 125, Num 2, pp 219-228, issn 0392-9523Article

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

Distributed algorithm for better approximation of the maximum matchingCZYGRINOW, A; HANCKOWIAK, M.Lecture notes in computer science. 2003, pp 242-251, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

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

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 the Bipartite Unique Perfect Matching ProblemTHANH MINH HOANG; MAHAJAN, Meena; THIERAUF, Thomas et al.Lecture notes in computer science. 2006, pp 453-464, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

On two-processor scheduling and maximum matching in permutation graphsRAMNATH, S; SUNDER, S.Information processing letters. 1996, Vol 57, Num 6, pp 321-327, issn 0020-0190Article

Partitioning graph matching with constraintsBLAKE, R. E.Pattern recognition. 1994, Vol 27, Num 3, pp 439-446, issn 0031-3203Article

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

Combinatorial algorithms for matchings, even factors and square-free 2-factorsPAP, Gyula.Mathematical programming. 2007, Vol 110, Num 1, pp 57-69, issn 0025-5610, 13 p.Conference Paper

On the index of tricyclic graphs with perfect matchingsXIANYA GENG; SHUCHAO LI; XUECHAO LI et al.Linear algebra and its applications. 2009, Vol 431, Num 12, pp 2304-2316, issn 0024-3795, 13 p.Article

A degree condition implying that every matching is contained in a hamiltonian cycleAMAR, Denise; FLANDRIN, Evelyne; GANCARZEWICZ, Grzegorz et al.Discrete mathematics. 2009, Vol 309, Num 11, pp 3703-3713, issn 0012-365X, 11 p.Article

Graph similarity scoring and matchingZAGER, Laura A; VERGHESE, George C.Applied mathematics letters. 2008, Vol 21, Num 1, pp 86-94, issn 0893-9659, 9 p.Article

Maximum-size subgraphs of P4-sparse graphs admitting a perfect matchingNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2005, pp 68-79, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 12 p.Conference Paper

Algorithmes parallèles pour la résolution de problèmes de couplage dans les graphes = PARALLEL ALGORITHMS FOR SOME GRAPH MATCHING PROBLEMSLakhal, Jamel; Konig, Jean-Claude.1999, 125 p.Thesis

The CLARET algorithmPEARCE, A. R; CAELLI, T.Lecture notes in computer science. 1998, pp 407-408, issn 0302-9743, isbn 3-540-64383-4Conference Paper

Cyclomatic numbers of connected induced subgraphsXINGXING YU.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 275-284, issn 0012-365XArticle

Improved linear time approximation algorithms for weighted matchingsDRAKE, Doratha E; HOUGARDY, Stefan.Lecture notes in computer science. 2003, pp 14-23, issn 0302-9743, isbn 3-540-40770-7, 10 p.Conference Paper

Matching RDF graphsCARROLL, Jeremy J.Lecture notes in computer science. 2002, pp 5-15, issn 0302-9743, isbn 3-540-43760-6, 11 p.Conference Paper

Tight bounds on maximal and maximum matchingsBIEDL, Therese; DEMAINE, Erik D; DUNCAN, Christian A et al.Lecture notes in computer science. 2001, pp 308-319, issn 0302-9743, isbn 3-540-42985-9Conference Paper

Maximum vertex-weighted matching in strongly chordal graphsCAMPELO, M. B; KLEIN, S.Discrete applied mathematics. 1998, Vol 84, Num 1-3, pp 71-77, issn 0166-218XArticle

The branching graphs of polyhexes: some elementary theorems, conjectures and open questionsKIRBY, E. C; GUTMAN, I.Journal of mathematical chemistry. 1993, Vol 13, Num 3-4, pp 359-374, issn 0259-9791Article

Matchings and the sum functionFAN, C. K.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 205-209, issn 0012-365XArticle