Some properties of irreducible coverings by cliques of complete multipartite graphs

DOI10.1016/0095-8956(80)90060-XzbMath0357.05057MaRDI QIDQ1237990

Ioan Tomescu

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

cliquescomplete multipartite graphsirreducible coverings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

On the number of irreducible coverings by edges of complete bipartite graphs ⋮ Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets

Cites Work

• On cliques in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Some properties of irreducible coverings by cliques of complete multipartite graphs