Node coverings with odd chains

DOI10.1002/JGT.3190100206zbMATH Open0651.05055OpenAlexW1966639249MaRDI QIDQ3795705FDOQ3795705

Authors: Dominique De Werra 

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100206

Recommendations

• Minimum covering algorithm on bipartite graph
• Variation on a theorem of König
• Generalized edge packings
• scientific article; zbMATH DE number 175738
• Publication:3490013

zbMATH Keywords

bipartite graphsmatchingsmin-max theoremnetwork flow techniquesnode coveringsodd chains

Mathematics Subject Classification ID

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

Cited In (3)

• Partitions into odd chains
• Variation on a theorem of König
• Generalized edge packings

This page was built for publication: Node coverings with odd chains

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