Non-separating trees in connected graphs

DOI10.1016/j.disc.2009.03.037zbMath1202.05023OpenAlexW1975608169MaRDI QIDQ1045001

Namrata P. Tholiya, Ajit A. Diwan

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.03.037

zbMATH Keywords

minimum degreeisomorphic subtreenon-separating tree

Mathematics Subject Classification ID

Trees (05C05)

Related Items (13)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Connectivity keeping trees in k-connected graphs ⋮ Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs ⋮ Connectivity preserving trees in k‐connected or k‐edge‐connected graphs ⋮ Connectivity keeping trees in 3-connected or 3-edge-connected graphs ⋮ Mader's conjecture for graphs with small connectivity ⋮ Connectivity keeping stars or double-stars in 2-connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in 2-connected graphs ⋮ Connectivity keeping trees in \(2\)-connected graphs with girth conditions ⋮ Connectivity keeping trees in 2-connected graphs ⋮ Connectivity keeping paths in \(k\)-connected bipartite graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Cites Work

• Non-separating induced cycles in graphs
• Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-separating trees in connected graphs