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