Generating the cycle space of planar graphs

MaRDI QIDQ2346473zbMATH OpenFDO

Authors Matthias Hamann

Publication date 2 June 2015

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.6392, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p34

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

cycle spacegraph theoryplanar graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Infinite graphs (05C63)

Abstract: We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some $mAut(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.

Review text

Summary: We prove that the cycle space of every planar finitely separable 3-connected graph \(G\) is generated by some \(\mathrm{Aut}(G)\)-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.

Recommendations

• On the cycle space of graphs
• The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
• Generating cycle spaces for graphs on surfaces with small genera
• Cycle spaces of graphs on the sphere and the projective plane
• Generating cycles in graphs with at most one end

Cites work

• Accessibility in transitive graphs
• Decomposing infinite 2-connected graphs into 3-connected components
• Duality in Infinite Graphs
• Duality of infinite graphs
• Graph theory
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 41228 (Why is no real title available?)
• scientific article; zbMATH DE number 3515486 (Why is no real title available?)
• On fixing boundary points of transitive hyperbolic graphs
• Structure trees, networks and almost invariant sets
• The structure of locally finite two-connected graphs

Cited in

(9)

• On the cycle space of graphs
• A cycle-space invariant of the \(<2\)-distance-graph in the plane
• Generating cycle spaces for graphs on surfaces with small genera
• Planar transitive graphs
• The planar Cayley graphs are effectively enumerable. II
• A direct method for calculating cell cycles of a block map of a simple planar graph
• On invariant generating sets for the cycle space
• A note on the structure of locally finite planar quasi-transitive graphs
• Fundamental group and cycle space of dual graphs and applications

This page was built for publication: Generating the cycle space of planar graphs

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