Variation on a theorem of König

DOI10.1016/0012-365X(84)90015-3MaRDI QIDQ797595zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bipartite graphequitable colouringsequitable pairmaximum degree

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(10)

• On the use of augmenting chains in chain packings
• Generalized edge packings
• Growing balanced covering sets
• Equitable partitions into matchings and coverings in mixed graphs
• Minimum covering algorithm on bipartite graph
• Node coverings with odd chains
• Partitions into odd chains
• A short proof of K�nig's matching theorem
• scientific article; zbMATH DE number 4185652 (Why is no real title available?)
• Odd path packings

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)