Buscar
Mostrando ítems 1-10 de 75
The Graph Sandwich Problem for P-4-sparse graphs
(Elsevier Science BvAmsterdamHolanda, 2009)
On the Minimum Sum Coloring of P4-sparse graphs
(Springer Tokyo, 2014-03)
In this paper, we study the Minimum Sum Coloring (MSC) problem on P4-sparse graphs. In the MSC problem, we aim to assign natural numbers to vertices of a graph such that adjacent vertices get different numbers, and the sum ...
A one-to-one correspondence between potential solutions ofthe cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs
(Elsevier, 2015)
In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph Gand potentially optimal solutions for the minimum sum coloring problem in G(i.e. the ...
On the b-coloring of cographs and p-4-sparse graphs
(SPRINGER TOKYO, 2009)
On the b-coloring of cographs and p-4-sparse graphs
(SPRINGER TOKYO, 2009)
Recognizing Well Covered Graphs of Families with Special P (4)-Components
(Springer Japan KkTokyoJapão, 2013)
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs
(Elsevier Science, 2015-08)
In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph G and potentially optimal solutions for the minimum sum coloring problem in G (i.e. the ...
On the b-coloring of cographs and p-4-sparse graphsGRAPHS AND COMBINATORICS
(SPRINGER TOKYO, 2016)
On the b-coloring of cographs and p-4-sparse graphsGRAPHS AND COMBINATORICS
(SPRINGER TOKYO, 2016)