Buscar
Mostrando ítems 1-10 de 54
Coordinated graphs and clique graphs of clique-Helly perfect graphs
(2007)
A new class of graphs related to perfect graphs is defined in this work: coordinated graphs. A graph G is coordinated if the cardinality of a maximum set of cliques of H with a common vertex is equal to the cardinality of ...
Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
(ELSEVIER, 2008-04-01)
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence ...
Clique-perfectness of complements of line graphs
(Elsevier, 2015)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques
equals the minimum number of vertices intersecting all maximal cliques for each induced
subgraph. In this work, we give necessary and ...
Neural Network Models for the Maximum Clique Problem
(Ministerio de Educación Superior; Universidad de La Habana, Facultad de Matemática y Computación, Departamento de Matemática AplicadaModelación con Ecuaciones DiferencialesCiudad de la Habana, Cuba, 2023)
Clique-perfectness and balancedness of some graph classes
(Taylor & Francis, 2014-03)
A graph is clique-perfect if the maximum size of a clique-independent set (a set of pairwise disjoint maximal cliques) and the minimum size of a clique-transversal set (a set of vertices meeting every maximal clique) ...
Clique-perfectness of complements of line graphs
(Elsevier Science, 2015-05)
A graph is clique-perfect if the maximum number of pairwise disjoint maximal cliques equals the minimum number of vertices intersecting all maximal cliques for each induced subgraph. In this work, we give necessary and ...