#### Filter Results:

#### Publication Year

1989

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Graph bundles generalize the notion of covering graphs and graph products. In this paper we extend some of the methods for recognizing Cartesian product graphs to graph bundles. Two main notions are used. The rst one is the well-known equivalence relation ? deened on the edge-set of a graph. The second one is the concept of k-convex subgraphs. A subgraph H… (More)

An algebraic approach is proposed which can be used to solve different problems on fasci-agraphs and rotagraphs. A particular instance of this method computes the domination number of fasciagraphs and rotagraphs in O(logn) time, where n is the number of monographs of such a graph. Fasciagraphs and rotagraphs include complete grid graphs Pk 0 P, and graphs… (More)

Graph bundles generalize the notion of covering graphs and graph products. In [8], authors constructed an algorithm that ÿnds a presentation as a nontrivial Cartesian graph bundle for all graphs that are Cartesian graph bundles over triangle-free simple base. In [21], the unique square property is deÿned and it is shown that any equivalence relation… (More)