Clique-partitioned graphs
From MaRDI portal
Publication:2127629
Abstract: A graph of order where and is said to be weakly -clique-partitioned if its vertex set can be decomposed in a unique way into vertex-disjoint -cliques. It is strongly -clique-partitioned if in addition, the only -cliques of are the cliques in the decomposition. We determine the structure of such graphs which have the largest possible number of edges.
Recommendations
Cites work
- Graph theory applications
- scientific article; zbMATH DE number 3977022 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- On the structure of factorizable graphs
- On the theory of graphs
- Uniquely colorable Cayley graphs
- Uniqueness of colorings
Cited in
(6)- Clique-gated graphs
- Graphs vertex-partitionable into strong cliques
- scientific article; zbMATH DE number 1750103 (Why is no real title available?)
- scientific article; zbMATH DE number 3999981 (Why is no real title available?)
- On the partition and coloring of a graph by cliques
- Graph partition into small cliques
This page was built for publication: Clique-partitioned graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127629)