Some Matching Theorems

Jump To References Section

Authors

  • University of Nottingham ,IN
  • Panjab University ,IN

DOI:

https://doi.org/10.18311/jims/1968/16770

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.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Published

1968-12-01

How to Cite

Elliott, P. D., & Erdos, P. (1968). Some Matching Theorems. The Journal of the Indian Mathematical Society, 32(3-4), 215–219. https://doi.org/10.18311/jims/1968/16770