Generating the cycle space of planar graphs

zbMath1328.05133arXiv1411.6392MaRDI QIDQ2346473

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

zbMATH Keywords

graph theoryplanar graphscycle space

Mathematics Subject Classification ID

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

Related Items (2)

The planar Cayley graphs are effectively enumerable. II ⋮ Planar transitive graphs

Cites Work

• On fixing boundary points of transitive hyperbolic graphs
• Duality of infinite graphs
• Accessibility in transitive graphs
• Decomposing infinite 2-connected graphs into 3-connected components
• The structure of locally finite two-connected graphs
• Duality in Infinite Graphs
• Structure Trees, Networks and Almost Invariant Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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