DAM
2000
13 years 11 months ago
2000
DAM
2000
13 years 11 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...
DAM
2000
13 years 11 months ago
2000
DAM
2000
13 years 11 months ago
2000
For a
DAM
2000
13 years 11 months ago
2000
Let us denote a b = max(a; b) and a b = a + b for a; b R and extend this pair of operations to matrices and vectors in the same way as in conventional linear algebra, that is i...
DAM
2000
13 years 11 months ago
2000
We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...
DAM
2000
13 years 11 months ago
2000
This paper deals with facility location problems with pos=neg weights in trees. We consider two di erent objective functions which model two di erent ways to handle obnoxious faci...
DAM
2000
13 years 11 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
DAM
2000
13 years 11 months ago
2000
DAM
2000
13 years 11 months ago
2000
A graph G is chordal if it contains no chordless cycle of length at least four and is k-chordal if a longest chordless cycle in G has length at most k. In this note it is proved t...