Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

DOI10.1016/J.DISC.2018.10.001zbMath1400.05100arXiv1710.01883OpenAlexW2964114596WikidataQ128997308 ScholiaQ128997308MaRDI QIDQ1625789

Hong-Jian Lai, Yingzhi Tian, Ji Xiang Meng, Li Qiong Xu

Publication date: 29 November 2018

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

Full work available at URL: https://arxiv.org/abs/1710.01883

zbMATH Keywords

treesstrongly connected digraphsMader's conjecturesoriented double-starsoriented stars

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (8)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Mader's conjecture for graphs with small connectivity ⋮ 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

• Unnamed Item
• Connectivity keeping edges in graphs with large minimum degree
• Non-separating trees in connected graphs
• On critically h-connected simple graphs
• Vertices of small degree in critically \(n\)-connected digraphs
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping trees in k-connected graphs
• Connectivity keeping paths in k-connected graphs
• Critically n-Connected Graphs

This page was built for publication: Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs