Removable Cycles in Planar Graphs

DOI10.1112/JLMS/S2-31.2.193MaRDI QIDQ3699722zbMATH OpenOpenAlexFDO

Authors Bill Jackson, Herbert Fleischner

Publication date 1985

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-31.2.193

zbMATH Keywords

2-connected graphs2-connectivitycycleplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• On removable cycles in connected graphs.
• On removable cycles through every edge
• scientific article; zbMATH DE number 888846
• scientific article; zbMATH DE number 2070515
• On removable and non-separating even cycles in graphs

Cited in

(10)

• Removing circuits in 3-connected binary matroids
• Removable matchings and Hamiltonian cycles
• Compatible path-cycle-decompositions of plane graphs
• Removable circuits in multigraphs
• Cycles having the same modularity and removable edges in 2-connected graphs
• On removable even circuits in graphs
• Removable cycles avoiding two connected subgraphs
• Removable cycles in non-bipartite graphs
• On removable cycles through every edge
• Removable edges of cycles in 5-connected graphs

This page was built for publication: Removable Cycles in Planar Graphs

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