On the number of irreducible coverings by edges of complete bipartite graphs

DOI10.1016/0012-365X(96)81420-8zbMath0851.05082MaRDI QIDQ1916141

Ioan Tomescu

Publication date: 24 November 1996

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

zbMATH Keywords

generating functionirreducible coverings

Mathematics Subject Classification ID

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

Related Items (1)

Minimal coverings of uniform hypergraphs and \(P\)-recursiveness

Cites Work

• Some properties of irreducible coverings by cliques of complete multipartite graphs
• On a Class of Polynomials Associated with the Stars of a Graph and its Application to Node-Disjoint Decompositions of Complete Graphs and Complete Bipartite Graphs into Stars
• Unnamed Item

This page was built for publication: On the number of irreducible coverings by edges of complete bipartite graphs