Add to ORKGWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by the peripheral circuits to locally finite graphs. Such a generalization becomes possible by the admission of infinite circuits in the graph compactified by its ends
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
AbstractWe extend three results involving bicycles and left–right tours to infinite, locally finite ...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geode...
AbstractIt is proved that any one-to-one edge map f from a 3-connected graph G onto a graph G′, G an...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
The edge space of a finite graph G = (V, E) over a field F is simply an assignment of field element...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
AbstractWe extend Tutte's result that in a finite 3-connected graph the cycle space is generated by ...
AbstractWe extend three results involving bicycles and left–right tours to infinite, locally finite ...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, u...
We adapt the cycle space of a finite or locally graph to graphs with vertices of infinite degree, us...
We extend the basic theory concerning the cycle space of a finite graph to arbitrary infinite graphs...
We prove that the topological cycle space C(G) of a locally finite graph G is generated by its geode...
AbstractIt is proved that any one-to-one edge map f from a 3-connected graph G onto a graph G′, G an...
AbstractS. Locke proved that the cycle space of a 3-connected nonhamiltonian graph with minimum degr...
AbstractJackson and Wormald showed that every 3-connected planar graph G contains a Tutte cycle C su...
The edge space of a finite graph G = (V, E) over a field F is simply an assignment of field element...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractWe show that any 3-connected graph other than K4 or K5 contains a contractible circuit or co...
An infinite matroid is graphic if all of its finite minors are graphic and the intersection of any c...
AbstractIt was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math...