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.
Users
Please
log in to take part in the discussion (add own reviews or comments).