A clique in a graph G is a complete subgraph of G. A clique partition of G is a collection C of cliques such that each edge of G occurs in exactly one clique in C. The clique partition number cp(G) is the minimum size of a clique partition of G
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
A clique in a graph G is a complete subgraph of G. A clique partition of G is a collection C of cliq...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractSplit graphs are graphs formed by taking a complete graph and an empty graph disjoint from i...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
AbstractCliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal...
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
AbstractWe consider the problem of determining cp(G v Kmc), the smallest number of cliques required ...
AbstractFor a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
We first consider the problem of partitioning the edges of a graph G into bipartite cliques such tha...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
A clique in a graph G is a complete subgraph of G. A clique partition of G is a collection C of cliq...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
AbstractSplit graphs are graphs formed by taking a complete graph and an empty graph disjoint from i...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
AbstractCliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal...
AbstractWe first introduce the concept of the k-chromatic index of a graph, and then discuss some of...
AbstractWe consider the problem of determining cp(G v Kmc), the smallest number of cliques required ...
AbstractFor a graph G, a subgraph C is called a clique of G if C is a complete subgraph of G maximal...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
We first consider the problem of partitioning the edges of a graph G into bipartite cliques such tha...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractDecompositions of a graph by clique separators are investigated which have the additional pr...
AbstractWe study the problem of clique-partitioning a graph. We prove a new general upper bound resu...
DOI
Add to ORKG