Buscar
Mostrando ítems 1-10 de 25
On some graph classes related to perfect graphs: A survey
(Elsevier Science, 2020-07-15)
Perfect graphs form a well-known class of graphs introduced by Berge in the 1960s in terms of a min–max type equality involving two famous graph parameters. In this work, we survey certain variants and subclasses of perfect ...
Perfectness of clustered graphs
(Elsevier Science, 2013-11)
Given a clustered graph (G,V), that is, a graph G=(V,E) together with a partition V of its vertex set, the selective coloring problem consists in choosing one vertex per cluster such that the chromatic number of the subgraph ...
A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games
(Elsevier Science, 2013-02)
We characterize edge-perfect graphs and prove that it is co-NP-complete to recognize them. In consequence, recognizing the defining matrices of totally balanced packing games is also co-NP-complete, in contrast with the ...
On clique-perfect and k-perfect graphsARS COMBINATORIAARS COMB
(DEPT. OF COMBINATORICS AND OPTIMIZATION, UNIVERSITY OF WATERLOO, 2017)
On clique-perfect and k-perfect graphsARS COMBINATORIAARS COMB
(DEPT. OF COMBINATORICS AND OPTIMIZATION, UNIVERSITY OF WATERLOO, 2017)
Partial characterizations of clique-perfect graphs i: subclasses of claw-free graphsDISCRETE APPLIED MATHEMATICS
(ELSEVIER SCIENCE BV, 2016)
Partial characterizations of clique-perfect graphs i: subclasses of claw-free graphsDISCRETE APPLIED MATHEMATICS
(ELSEVIER SCIENCE BV, 2016)