DM
2002
13 years 4 months ago
2002
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on...
DM
2002
13 years 4 months ago
2002
The well-known theorem by Gallai
DM
2002
13 years 4 months ago
2002
The edge clique graph of a graph G is one having as vertices the edges of G, two vertices being adjacent if the corresponding edges of G belong to a common clique. We describe cha...
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgrap...
DM
2002
13 years 4 months ago
2002
DM
2002
13 years 4 months ago
2002
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This pap...
DM
2002
13 years 4 months ago
2002
This paper is a continuation of Equimodular curves, LSE-CDAM-2000-17. First, it is shown by algebraic means that the equimodular curves for a reducible matrix are closed curves. T...