The Matrix Rearrangement Procedure for Graph-Theoretical Algorithms and Its Application to the Generation of Fundamental Cycles

A @Q-cycle of a hypergraph is a cycle including an edge that contains at least three base points of the cycle. We show that if a hypergraph H=(V,E) has no @Q-cycle, and |e|>=3, for every edge e@__ __E, then @__ __"e"@__ __"E(|e|-1)=<2|V|-2 with equality ...

Let B n denote the family of all maximal bipartite planar graphs on n vertices. Given a family of graphs H, let B n ( H ) denote the family of all maximal bipartite planar graphs on n vertices which are not H-free. For graph G and a family of ...

Cayley graphs have been extensively studied by graph and group theorists, computer scientists, molecular biologists and coding theorists. We focus on two challenging problems on Cayley graphs arising on sequence comparison: hamiltonian cycle and graph ...