2-connected spanning subgraphs of circuit graphs

DOI10.1016/j.disc.2024.114228MaRDI QIDQ6635095

Daiki Takahashi, Kenta Ozeki, Atsuhiro Nakamoto

Publication date: 9 November 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

3-connected planar graphcircuit graph2-connected spanning subgraph

Mathematics Subject Classification ID

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

Cites Work

• Spanning closed walks and TSP in 3-connected planar graphs
• 3-trees with few vertices of degree 3 in circuit graphs
• Connected spanning subgraphs of 3-connected planar graphs
• 2-connected spanning subgraphs of planar 3-connected graphs
• 2-walks in circuit graphs
• Long cycles in 3-connected graphs
• A note on circuit graphs
• Tough graphs and Hamiltonian circuits.
• A Theorem on Planar Graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Prism‐hamiltonicity of triangulations
• Trees in Polyhedral Graphs
• Polyhedra without cubic vertices are prism-hamiltonian
• Unnamed Item
• Unnamed Item

This page was built for publication: 2-connected spanning subgraphs of circuit graphs