Robust recoverable perfect matchings

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|66|3|210-213

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.66, Iss.3, 2015-10, pp. : 210-213

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Random Lifts Of Graphs: Perfect Matchings

By Linial* Nathan   Rozenman Eyal  

Combinatorica, Vol. 25, Iss. 4, 2005-07 ,pp. : 407-424

Springer Publishing Company

Access to resources Recommend Favorite

On Perfect k-Matchings

By Lu Hongliang   Wang Wei  

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 229-235

Springer Publishing Company

Access to resources Recommend Favorite

Ordering trees with nearly perfect matchings by algebraic connectivity

By Zhang Li  

Chinese Annals of Mathematics, Series B, Vol. 29, Iss. 1, 2008-02 ,pp. : 71-84

Springer Publishing Company

Access to resources Recommend Favorite

Perfect Matchings, Catalan Numbers, and Pascal's Triangle

By Došlić Tomislav  

Mathematics Magazine, Vol. 80, Iss. 3, 2007-06 ,pp. : 219-226

Mathematical Association of America

Access to resources Recommend Favorite

On the smallest sets blocking simple perfect matchings in a convex geometric graph

By Keller Chaya  

Israel Journal of Mathematics, Vol. 187, Iss. 1, 2012-01 ,pp. : 465-484

Springer Publishing Company

Access to resources Recommend Favorite