WG
2001
Springer
14 years 6 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...
WG
2001
Springer
14 years 6 months ago
2001
Springer
WG
2001
Springer
14 years 6 months ago
2001
Springer
WG
2001
Springer
14 years 6 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...
WG
2001
Springer
14 years 6 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
WG
2001
Springer
14 years 6 months ago
2001
Springer
WG
2001
Springer
14 years 6 months ago
2001
Springer
WG
2001
Springer
14 years 6 months ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
WG
2001
Springer
14 years 6 months ago
2001
Springer
We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicograph...