On clique partitions of split graphs

DOI10.1016/0012-365X(91)90297-FzbMath0756.05072MaRDI QIDQ1182960

Julin Wu, Walter D. Wallis

Publication date: 28 June 1992

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

zbMATH Keywords

NP-completesplit graphsclique partition numberclique partitions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (5)

Clique covering and clique partition in generalizations of line graphs ⋮ An overview of graph covering and partitioning ⋮ Weighted 2-sections and hypergraph reconstruction ⋮ Monopolar graphs: complexity of computing classical graph parameters ⋮ Edge clique partition in \((k,\ell)\)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On clique partitions of split graphs