scientific article

zbMATH Open0769.05078MaRDI QIDQ4034791

S. V. Tikhanovtsev

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

bipartite graphsefficient algorithmoptimal vertex covering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Title not available (Why is that?) ⋮ Bipartite Coverings of Graphs ⋮ On the equivalence covering number of splitgraphs ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Covering Intersecting Bi-set Families under Matroid Constraints ⋮ Title not available (Why is that?) ⋮ Biclique Coverings, Rectifier Networks and the Cost of ε-Removal

Recommendations

• Covering graphs with few complete bipartite subgraphs 👍 👎
• On covering graphs by complete bipartite subgraphs 👍 👎
• Coverings of complete bipartite graphs and associated structures 👍 👎
• Covering a graph by complete bipartite graphs 👍 👎
• Bipartite covering graphs 👍 👎
• On covering a bipartite graph with cycles 👍 👎
• Bipartite Coverings of Graphs 👍 👎
• On some covering graphs of a graph 👍 👎
• Covering Graphs with Few Complete Bipartite Subgraphs 👍 👎

This page was built for publication:

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