102 search results - page 14 / 21 » Dually Chordal Graphs |
135
click to vote
DM
2002
15 years 4 months ago
2002
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...
140
Voted
AAIM
2007
Springer
15 years 11 months ago
2007
Springer
Let M be a class of 0/1-matrices. A 0/1/ -matrix A where the s induce a submatrix is a probe matrix of M if the s in A can be replaced by 0s and 1s such that A becomes a member of ...
153
Voted
DAM
2007
15 years 5 months ago
2007
: Gavril [GA4] defined two new families of intersection graphs: the interval-filament graphs and the subtree-filament graphs. The complements of intervalfilament graphs are the coi...
119
click to vote
SWAT
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
139
Voted
ER
2004
Springer
15 years 10 months ago
2004
Springer
In this paper, we develop a novel Web Usage Manipulation Language (WUML) which is a declarative language for manipulating Web log data. We assume that a set of trails formed by use...