The generating function of irreducible coverings by edges of complete \(k\)-partite graphs

DOI10.1016/0012-365X(94)00176-JzbMath0838.05086OpenAlexW2090228550MaRDI QIDQ1910527

Virgil Domocoş, Serban Buzeteanu

Publication date: 24 March 1996

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00176-j

zbMATH Keywords

generating functionspeciesirreducible coveringsminimal 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

• Une théorie combinatoire des séries formelles

This page was built for publication: The generating function of irreducible coverings by edges of complete \(k\)-partite graphs