The following pages link to On cycle bases of a graph (Q3208700):
Displayed 16 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Computational aspects of M. C. Escher's ribbon patterns (Q489754) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Classes of cycle bases (Q868389) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
- Edge and vertex intersection of paths in a tree (Q1060226) (← links)
- Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
- Characterizations of outerplanar graphs (Q1255015) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) (Q1682895) (← links)
- On graphs whose orientations are determined by their Hermitian spectra (Q2200431) (← links)
- On Optimum Cycle Bases (Q3438962) (← links)
- Sensor Network Localization on the Group of Three-Dimensional Displacements (Q3457100) (← links)
- Classification of robust cycle bases and relations to fundamental cycle bases (Q5198007) (← links)