WG
13 years 10 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
13 years 10 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...
WG
13 years 10 months ago
2001 Springer WG
13 years 10 months ago
2001 Springer WG
13 years 10 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...
|
Theoretical Computer Science