117 search results - page 7 / 24 » Polarity of chordal graphs |
DM
2002
13 years 7 months ago
2002
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in
STACS
1994
Springer
13 years 11 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
IWPEC
2004
Springer
14 years 29 days ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
CIAC
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
ISHPC
2003
Springer
14 years 24 days ago
2003
Springer
Abstract. The class of dense circulant graphs of degree four with optimal distance-related properties is analyzed in this paper. An algebraic study of this class is done. Two geome...