The Journal of the Indian Mathematical Society

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Some Matching Theorems


Affiliations
1 University of Nottingham, India
2 Panjab University, India
     

   Subscribe/Renew Journal


A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge.
Subscription Login to verify subscription
User
Notifications
Font Size


Abstract Views: 226

PDF Views: 0




  • Some Matching Theorems

Abstract Views: 226  |  PDF Views: 0

Authors

P. D. Elliott
University of Nottingham, India
P. Erdos
Panjab University, India

Abstract


A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge.