Pages that link to "Item:Q1182960"
From MaRDI portal
The following pages link to On clique partitions of split graphs (Q1182960):
Displaying 20 items.
- Split clique graph complexity (Q393107) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- Graph partition into small cliques (Q741755) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- Split dimension of graphs (Q1176734) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- On splitting the Clebsch graph (Q1344159) (← links)
- Clique and anticlique partitions of graphs (Q1584251) (← links)
- Fully decomposable split graphs (Q1933640) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Weighted 2-sections and hypergraph reconstruction (Q2143117) (← links)
- Metric space method for constructing splitting partitions of graphs (Q2178736) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- On a \(k\)-clique-join of a class of partitionalble graphs (Q2573396) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- On split clique graphs (Q2918477) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- (Q4726289) (← links)