Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Maximal-clique partitions of interval graphs
View through CrossRef
AbstractIt is shown that if an interval graph possesses a maximal-clique partition then its clique covering and clique partition numbers are equal, and equal to the maximal-clique partition number. Moreover an interval graph has such a partition if and only if all its maximal cliques are edge-disjoint.
Cambridge University Press (CUP)
Title: Maximal-clique partitions of interval graphs
Description:
AbstractIt is shown that if an interval graph possesses a maximal-clique partition then its clique covering and clique partition numbers are equal, and equal to the maximal-clique partition number.
Moreover an interval graph has such a partition if and only if all its maximal cliques are edge-disjoint.
Related Results
Sobre grafos clique críticos
Sobre grafos clique críticos
Se llama completo de un grafo a un conjunto de vértices adyacentes entre si; si un completo es maximal con respecto a la inclusión, se dice que es un clique del grafo. Los cliques ...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
Rank-sparsity decomposition for planted quasi clique recovery
Rank-sparsity decomposition for planted quasi clique recovery
Abstract
In this paper, we apply the Rank-Sparsity Matrix Decomposition to the planted Maximum Quasi-Clique Problem (MQCP). This problem has ...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
CliReg: Clique-based robust Point Cloud Registration
CliReg: Clique-based robust Point Cloud Registration
We propose a branch-and-bound algorithm for robust rigid registration of two point clouds in the presence of a large number of outlier correspondences. For this purpose, we conside...
Quelques résultats combinatoires autour de la décomposition de Littlewood
Quelques résultats combinatoires autour de la décomposition de Littlewood
Cette thèse s'intéresse à des objets de combinatoire énumérative et plus particulièrement aux partitions d'entiers. Les partitions et les tableaux de Young sont des objets combinat...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...