Strong Covering of a Bipartite Graph

DOI10.1112/jlms/s2-3.1.86zbMath0209.28403OpenAlexW2060491092MaRDI QIDQ5610935

I. P. McWhirter, Daniel H. Younger

Publication date: 1971

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-3.1.86

Mathematics Subject Classification ID

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

Related Items (2)

Representing non-crossing cuts by phylogenetic trees ⋮ On two minimax theorems in graph

This page was built for publication: Strong Covering of a Bipartite Graph