Variation on a theorem of König

DOI10.1016/0012-365X(84)90015-3zbMATH Open0545.05049OpenAlexW1991100542MaRDI QIDQ797595FDOQ797595

Authors: Dominique De Werra 

Publication date: 1984

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

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90015-3

Recommendations

• Publication:5750892
• scientific article; zbMATH DE number 175738
• Minimum covering algorithm on bipartite graph
• Node coverings with odd chains
• On equitable coloring of bipartite graphs

zbMATH Keywords

bipartite graphmaximum degreeequitable colouringsequitable pair

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Partitions into odd chains
• Equitable partitions into matchings and coverings in mixed graphs
• Node coverings with odd chains
• Title not available (Why is that?)
• Odd path packings
• On the use of augmenting chains in chain packings
• Generalized edge packings
• Minimum covering algorithm on bipartite graph
• Growing balanced covering sets

This page was built for publication: Variation on a theorem of König

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