On cycle bases of a graph

DOI10.1002/NET.3230090203MaRDI QIDQ3208700zbMATH OpenOpenAlexFDO

Authors Maciej M. Sysło

Publication date 1979

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230090203

zbMATH Keywords

cycle basisspanning treevector space associated with a graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (05C99) Vector spaces, linear dependence, rank, lineability (15A03)

Cited in

(19)

• 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
• Characterizations of outerplanar graphs
• On finding a cycle basis with a shortest maximal cycle
• Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
• Cycle analysis of directed acyclic graphs
• On graphs whose orientations are determined by their Hermitian spectra
• Feynman graphs and hyperplane arrangements defined over \(\mathbb{F}_1\)
• On Optimum Cycle Bases
• Sensor network localization on the group of three-dimensional displacements
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Computational aspects of M. C. Escher's ribbon patterns
• Classification of robust cycle bases and relations to fundamental cycle bases
• Concordance of spatial graphs
• On the approximability of the minimum strictly fundamental cycle basis problem
• Classes of cycle bases
• Minimum cut bases in undirected networks

This page was built for publication: On cycle bases of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208700)