Short Cycles Connectivity
<|reference_start|>Short Cycles Connectivity: Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in which two adjacent cycles have at least one common vertex. If all adjacent cycles in the sequence share at least one edge, we talk about edge short cycles connectivity.   It is shown that the short cycles connectivity is an equivalence relation on the set of vertices, while the edge short cycles connectivity components determine an equivalence relation on the set of edges. Efficient algorithms for determining equivalence classes are presented.   Short cycles connectivity can be extended to directed graphs (cyclic and transitive connectivity). For further generalization we can also consider connectivity by small cliques or other families of graphs.<|reference_end|>
@article{batagelj2003short,
    title={Short Cycles Connectivity},
    author={V. Batagelj, M. Zaversnik},
    journal={DISCRETE MATH 307 (3-5): 310-318 FEB 6 2007},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0308011},
    primaryClass={cs.DS cs.DM}
}