Minor and minimum cycle bases of a 3-connected planar graph
From MaRDI portal
Publication:1034289
DOI10.1007/s10114-009-7160-5zbMath1182.05043OpenAlexW1970501868MaRDI QIDQ1034289
Publication date: 11 November 2009
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-009-7160-5
Related Items
Cites Work
- Unnamed Item
- Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen
- Minimal cycle bases of outerplanar graphs
- Generating cycle spaces for graphs on surfaces with small genera
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- On connectivities of tree graphs
- On Algorithms for Enumerating All Circuits of a Graph
- An algorithm for the longest cycle problem
- Minimum cycle bases of Halin graphs
- On Representatives of Subsets
- How to Draw a Graph