Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets

DOI10.1007/PL00013412zbMath1010.05060OpenAlexW2088622957MaRDI QIDQ5952387

Haruhide Matsuda, Mikio Kano

Publication date: 9 January 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00013412

Mathematics Subject Classification ID

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

Related Items (1)

Maximum and optimal 1-2 matching problem of the different kind

This page was built for publication: Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets