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

ISSN： 0021-2172

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

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

Robust recoverable perfect matchings

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

John Wiley & Sons Inc

Access to resources Recommend Favorite

Geometric Condition Measures and Smoothness Condition Measures for Closed Convex Sets and Linear Regularity of Infinitely Many Closed Convex Sets

By Hu H.

Journal of Optimization Theory and Applications, Vol. 126, Iss. 2, 2005-08 ,pp. : 287-308

Springer Publishing Company

Access to resources Recommend Favorite

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

Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon

By An P. T.

Numerical Functional Analysis and Optimization, Vol. 31, Iss. 3, 2010-03 ,pp. : 221-231

Taylor & Francis Ltd

Access to resources Recommend Favorite