Spanning trees with nonseparating paths
From MaRDI portal
Abstract: We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this property is closely related to the Hamiltonicity of the graph. For graphs with a 1- or 2-vertex cut, the Hamiltonicity also plays a central role. We also deal with spanning trees satisfying this property restricted to paths arising from fundamental cycles. The cycle space of a graph can be generated by the fundamental cycles of any spanning tree, and Tutte showed, that for a 3-connected graph, it can be generated by nonseparating cycles. We are also interested in the existence of a fundamental basis consisting of nonseparating cycles.
Recommendations
- Nonseparating cycles and planarity of graph-cells
- Non-separating spanning trees and out-branchings in digraphs of independence number 2
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- scientific article; zbMATH DE number 2059947
- scientific article; zbMATH DE number 1953097
Cites work
- A Theorem on Planar Graphs
- Graph Classes: A Survey
- Graph connectivity after path removal
- Graph theory
- Graph theory
- Graphs on surfaces
- How to Draw a Graph
- Induced paths in 5-connected graphs
- Non-separating paths in 4-connected graphs
- Non-separating subgraphs
- Non-separating subgraphs after deleting many disjoint paths
- Separation of vertices by a circuit
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Three small cubic graphs with interesting hamiltonian properties
Cited in
(3)
This page was built for publication: Spanning trees with nonseparating paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501078)
