684 search results - page 18 / 137 » A characterization of b-perfect graphs |
100
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
131
click to vote
JAPLL
2006
15 years 1 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
DM
1998
15 years 1 months ago
1998
Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γperfect if β(H) = Γ(H),...
124
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: The investigation of plant genome structure and evolution requires comprehensive characterization of repetitive sequences that make up the majority of higher plant nuc...
ARSCOM
1998
15 years 1 months ago
1998
The vertex set of a halved cube Qd consists of a bipartition vertex set of a cube Qd and two vertices are adjacent if they have a common neighbour in the cube. Let d ≥ 5. Then i...