253 search results - page 23 / 51 » Perfection thickness of graphs |
108
click to vote
FAW
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
SIAMDM
2008
14 years 11 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
101
click to vote
FSTTCS
2007
Springer
15 years 6 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
117
click to vote
JCT
2010
14 years 10 months ago
2010
Let m1, m2, . . . , mt be a list of integers. It is shown that there exists an integer N such that for all n ≥ N, the complete graph of order n can be decomposed into edge-disjo...
108
click to vote
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
A secret sharing schemefor the prohibited structure is a method of sharing a master key among a finite set of participants in such a way that only certain pre-specified subsetsof ...