Connectivity keeping stars or double-stars in 2-connected graphs

DOI10.1016/j.disc.2017.10.017zbMath1380.05116arXiv1707.01165OpenAlexW2962941633MaRDI QIDQ1699561

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

Publication date: 23 February 2018

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

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

zbMATH Keywords

stars2-connected graphsdouble-starsMader's conjecture

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Connectivity (05C40)

Related Items (9)

Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions ⋮ Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs ⋮ 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
• Connectivity keeping trees in k-connected graphs
• Connectivity keeping paths in k-connected graphs
• Critically n-Connected Graphs

This page was built for publication: Connectivity keeping stars or double-stars in 2-connected graphs