A note on the ultimate categorical matching in a graph

DOI10.1016/S0012-365X(02)00392-8zbMATH Open1012.05129MaRDI QIDQ1849960

Lih-Hsing Hsu

Publication date: 2 December 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphmatchinggraph capacitycategorical product

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

This page was built for publication: A note on the ultimate categorical matching in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849960)