On cycle bases of a graph
From MaRDI portal
Publication:3208700
DOI10.1002/net.3230090203zbMath0418.05047OpenAlexW2162278146MaRDI QIDQ3208700
Publication date: 1979
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230090203
Related Items
Cycle analysis of directed acyclic graphs, On finding a cycle basis with a shortest maximal cycle, Sensor Network Localization on the Group of Three-Dimensional Displacements, Classes of cycle bases, Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\), Concordance of spatial graphs, On the approximability of the minimum strictly fundamental cycle basis problem, On graphs whose orientations are determined by their Hermitian spectra, Cycle bases in graphs characterization, algorithms, complexity, and applications, Computational aspects of M. C. Escher's ribbon patterns, Feynman graphs and hyperplane arrangements defined over \(\mathbb{F}_1\), Minimum cut bases in undirected networks, Classification of robust cycle bases and relations to fundamental cycle bases, Characterizations of outerplanar graphs, Edge-swapping algorithms for the minimum fundamental cycle basis problem, On finding cycle bases and fundamental cycle bases with a shortest maximal cycle, Edge and vertex intersection of paths in a tree, Triangulated edge intersection graphs of paths in a tree, On Optimum Cycle Bases