Skip to search formSkip to main contentSkip to account menu

Cycle space

In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its Eulerian subgraphs. This set of subgraphs… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations

Broader (1)

Algebraic graph theory
Basis (linear algebra)Betti numberCircuit rankConnected component (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Tools for counting odd cycles in graphs
  • Donovan R. Hare
  • Journal of combinatorial theory. Series B (Print)
  • 2019
  • Corpus ID: 132737500
2018
2018
An iteration method for computing the total number of spanning trees and its applications in graph theory
2012
2012
Reduction of interaction delays in networks
Delayed interactions are a common property of coupled natural systems and therefore arise in a variety of different applications… 
2012
2012
Heat Bounds and the Blowtorch Theorem
We study driven systems with possible population inversion and we give optimal bounds on the relative occupations in terms of… 
2011
2011
On the approximability of the minimum strictly fundamental cycle basis problem
2009
2009
Topological Circles and Euler Tours in Locally Finite Graphs
We obtain three results concerning topological paths ands circles in the end compactification $|G|$ of a locally finite connected… 
2005
2005
A greedy approach to compute a minimum cycle basis of a directed graph
1990
1990
The hamilton spaces of cayley graphs on abelian groups
1981
1981
The basis number of a graph
  • E. Schmeichel
  • Journal of combinatorial theory. Series B (Print)
  • 1981
  • Corpus ID: 31381752
1979
1979
Interval matroids and graphs
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)