Some properties of irreducible coverings by cliques of complete multipartite graphs

DOI10.1016/0095-8956(80)90060-XMaRDI QIDQ1237990zbMATH OpenFDO

Authors Ioan Tomescu

Publication date 1980

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

zbMATH Keywords

complete multipartite graphscliquesirreducible coverings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• scientific article; zbMATH DE number 3335813 (Why is no real title available?)
• scientific article; zbMATH DE number 3368554 (Why is no real title available?)
• On cliques in graphs

Cited in

(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

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

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