Highly connected triples and Mader's conjecture

DOI10.1002/JGT.23144MaRDI QIDQ6642502

Qinghai Liu, Kai Ying, Yanmei Hong

Publication date: 24 November 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

\(k\)-connected\(k\)-connected triplesconnectivity-keeping trees

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Cites Work

• Connectivity keeping edges in graphs with large minimum degree
• Non-separating trees in connected graphs
• Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
• Connectivity keeping stars or double-stars in 2-connected graphs
• Connectivity keeping paths in \(k\)-connected bipartite graphs
• Connectivity keeping caterpillars and spiders in 2-connected graphs
• Connectivity keeping trees in 2-connected graphs
• Connectivity keeping trees in \(k\)-connected graphs
• Connectivity keeping paths in k-connected graphs
• Critically n-Connected Graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity
• Mader's conjecture for graphs with small connectivity

This page was built for publication: Highly connected triples and Mader's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642502)