Graph partition into small cliques
From MaRDI portal
Recommendations
- Partitioning into graphs with only small components
- Clique-partitioned graphs
- Graph partitioning
- scientific article; zbMATH DE number 637295
- Partitions of graphs into small and large sets
- scientific article; zbMATH DE number 4031746
- On clique partitions of split graphs
- Clique and anticlique partitions of graphs
- Partitions of Graphs
- Graphs vertex-partitionable into strong cliques
Cites work
- Clique coverings and partitions of line graphs
- Clique partitions and clique coverings
- Disjoint cliques and disjoint maximal independent sets of vertices in graphs
- Disjoint triangles and quadrilaterals in a graph
- Graph theory
- How many graphs are unions of k‐cliques?
- On the maximal number of independent circuits in a graph
- On the maximal number of independent triangles in graphs
- On the maximum number of independent cycles in a graph
Cited in
(11)- Each 11-vertex graph without 4-cliques has a triangle-free 2-partition of vertices
- Graph partition into \(K_{3}\)s and \(K_{4}\)s
- Almost regular decompositions of a graph
- scientific article; zbMATH DE number 426342 (Why is no real title available?)
- Clique-partitioned graphs
- Partitions of graphs into small and large sets
- Disjoint cliques in claw-free graphs
- The confirmation of a conjecture on disjoint cycles in a graph
- Graphs vertex-partitionable into strong cliques
- A note on abelian partitionable groups
- scientific article; zbMATH DE number 3885943 (Why is no real title available?)
This page was built for publication: Graph partition into small cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741755)
