Author： Linial* Nathan Rozenman Eyal
Publisher： Springer Publishing Company
ISSN： 0209-9683
Source： Combinatorica, Vol.25, Iss.4, 2005-07, pp. : 407-424
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
Related content
Distance-2-Matchings of Random Graphs
By Reidys C.
Annals of Combinatorics, Vol. 8, Iss. 1, 2004-05 ,pp. :
Access to resources
Recommend
Robust recoverable perfect matchings
NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 66, Iss. 3, 2015-10 ,pp. :
Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. :
Bicolored Matchings in Some Classes of Graphs
By Costa M. C. Werra D. de Picouleau C. Ries B.
Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-02 ,pp. :