684 search results - page 42 / 137 » A characterization of b-perfect graphs |
98
Voted
ECAI
2000
Springer
15 years 6 months ago
2000
Springer
We present in this paper a method to insert new concepts in an existing information extraction system based on a conceptual graph architecture. We use verb patterns as conceptual s...
111
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
120
click to vote
DM
2006
15 years 1 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
100
click to vote
CATS
2008
15 years 3 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
103
click to vote
DAM
2007
15 years 1 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...