Strong Covering of a Bipartite Graph

DOI10.1112/JLMS/S2-3.1.86MaRDI QIDQ5610935zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(2)

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

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

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