On clique partitions of split graphs

DOI10.1016/0012-365X(91)90297-FMaRDI QIDQ1182960zbMATH OpenFDO

Authors Walter D. Wallis, Julin Wu

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)

Recommendations

• On split clique graphs
• Split clique graph complexity
• Split clique graph complexity
• Edge clique partition in \((k,\ell)\)-graphs
• Restrictions of graph partition problems. I

Cited in

(24)

• Split clique graph complexity
• Clique and anticlique partitions of graphs
• On the partition and coloring of a graph by cliques
• An overview of graph covering and partitioning
• On a \(k\)-clique-join of a class of partitionalble graphs
• On split clique graphs
• Clique and anticlique partitions of graphs
• scientific article; zbMATH DE number 4121434 (Why is no real title available?)
• Clique partitioning of interval graphs with submodular costs on the cliques
• Split dimension of graphs
• Edge clique partition in \((k,\ell)\)-graphs
• Fully decomposable split graphs
• On splitting the Clebsch graph
• Weighted 2-sections and hypergraph reconstruction
• Clique covering and clique partition in generalizations of line graphs
• Solving some NP-complete problems using split decomposition
• Graph partition into small cliques
• Metric space method for constructing splitting partitions of graphs
• Split clique graph complexity
• Monopolar graphs: complexity of computing classical graph parameters
• Fully decomposable split graphs
• The complexity of partitioning into disjoint cliques and a triangle-free graph
• Splitting Edge Partitions of Graphs
• scientific article; zbMATH DE number 3999981 (Why is no real title available?)

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

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