|
Volumn 256, Issue 1-2, 2002, Pages 487-488
|
A note on the ultimate categorical matching in a graph
|
Author keywords
Categorical product; Graph capacity functions; Matching
|
Indexed keywords
|
EID: 31244438084
PISSN: 0012365X
EISSN: None
Source Type: Journal
DOI: 10.1016/S0012-365X(02)00392-8 Document Type: Article |
Times cited : (1)
|
References (7)
|