Some Matching Theorems
Jump To References Section
DOI:
https://doi.org/10.18311/jims/1968/16770Abstract
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 ...
Downloads
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
Issue
Section
Articles
License
Copyright (c) 1968 P. D. Elliott, P. Erdos
This work is licensed under a Creative Commons Attribution 4.0 International License.