Mader's conjecture for graphs with small connectivity
From MaRDI portal
Publication:6057633
DOI10.1002/jgt.22831zbMath1522.05252arXiv2101.11777OpenAlexW3124886953WikidataQ113915814 ScholiaQ113915814MaRDI QIDQ6057633
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.11777
Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (3)
Connectivity keeping trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs ⋮ Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
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 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
- Connectivity keeping trees in 2‐connected graphs
- Critically n-Connected Graphs
- Unnamed Item
This page was built for publication: Mader's conjecture for graphs with small connectivity