On cycle bases of a graph
- 1 June 1979
- Vol. 9 (2) , 123-132
- https://doi.org/10.1002/net.3230090203
Abstract
The paper deals with bases of the vector space associated with a graph. Section 2 presents two characterizations of the cycle basis which can be derived from a spanning tree of a graph, and Section 3 contains the counterexamples for the conjecture of Dixon and Goodman. Finally, some new problems are posed.Keywords
This publication has 3 references indexed in Scilit:
- On Algorithms for Enumerating All Circuits of a GraphSIAM Journal on Computing, 1976
- An algorithm for the longest cycle problemNetworks, 1976
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969