Polynomial-time partition of a graph into cliques.

Plotnikov, Anatoly D.

Displaying similar documents to “Polynomial-time partition of a graph into cliques.”

Antidomatic number of a graph.

Zelinka, Bohdan (1996)

Archivum Mathematicum

Similarity:

On some partitions of a graph, I

Zofia Majcher, J. Płonka (1987)

Applicationes Mathematicae

Similarity:

Sets of parts such that the partition function is even

Ben Saïd, J.-N. Nicolas (2003)

Acta Arithmetica

Similarity:

On the partition of the genotypic function

W. Klonecki (1966)

Applicationes Mathematicae

Similarity:

On the pseudoachromatic number of a graph

V. Bhave (1979)

Fundamenta Mathematicae

Similarity:

Vertex degree sequences of graphs with small number of circuits.

Gutman, Ivan (1989)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity:

The B-Domatic Number of a Graph

Odile Favaron (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Besides the classical chromatic and achromatic numbers of a graph related to minimum or minimal vertex partitions into independent sets, the b-chromatic number was introduced in 1998 thanks to an alternative definition of the minimality of such partitions. When independent sets are replaced by dominating sets, the parameters corresponding to the chromatic and achromatic numbers are the domatic and adomatic numbers d(G) and ad(G). We introduce the b-domatic number bd(G) as the counterpart...