arXiv:math/0511600 [math.CO]AbstractReferencesReviewsResources
Sufficient conditions for the existence of perfect heterochromatic matchings in colored graphs
Published 2005-11-24, updated 2007-11-30Version 2
This paper has been withdrawn by the author(s), due an error in the proof.
Comments: This paper has been withdrawn
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1708.05396 [math.CO] (Published 2017-08-17)
Sufficient conditions for graphs to be $k$-connected, maximally connected and super-connected
arXiv:math/0611070 [math.CO] (Published 2006-11-03)
On existence of [a,b]-factors avoiding given subgraphs
arXiv:1606.07874 [math.CO] (Published 2016-06-25)
On certain hyperplane arrangements and colored graphs