Pendant tree-connectivity
From MaRDI portal
Publication:1059087
DOI10.1016/0095-8956(85)90083-8zbMath0566.05041OpenAlexW2049851259MaRDI QIDQ1059087
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90083-8
Related Items (45)
Path-connectivity in graphs ⋮ Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Sharp upper bounds for generalized edge-connectivity of product graphs ⋮ Graphs with large generalized (edge-)connectivity ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\) ⋮ The 3-path-connectivity of the \(k\)-ary \(n\)-cube ⋮ Path 3-(edge-)connectivity of lexicographic product graphs ⋮ The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Path connectivity of line graphs and total graphs of complete bipartite graphs ⋮ Reliability assessment of the divide-and-swap cube in terms of generalized connectivity ⋮ On two generalized connectivities of graphs ⋮ On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices ⋮ Connectivity, super connectivity and generalized 3-connectivity of folded divide-and-swap cubes ⋮ The \(\kappa_k\)-connectivity of line graphs ⋮ The 4-set tree connectivity of \((n, k)\)-star networks ⋮ A result on the 3-generalized connectivity of a graph and its line graph ⋮ The generalized 4-connectivity of hierarchical cubic networks ⋮ The reliability analysis based on the generalized connectivity in balanced hypercubes ⋮ The minimum size of a graph with given tree connectivity ⋮ The 4-component connectivity of alternating group networks ⋮ \(k\)-tree connectivity of line graphs ⋮ The generalized 3-connectivity of star graphs and bubble-sort graphs ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ Tree connectivities of Cayley graphs on abelian groups with small degrees ⋮ On generalized 3-connectivity of the strong product of graphs ⋮ On the difference of two generalized connectivities of a graph ⋮ Steiner tree packing number and tree connectivity ⋮ The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The generalized connectivity of the line graph and the total graph for the complete bipartite graph ⋮ The generalized 3-connectivity of the Mycielskian of a graph ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ Structural Properties of Generalized Exchanged Hypercubes ⋮ Path-connectivity of lexicographic product graphs ⋮ Generalized connectivity of some total graphs ⋮ Cycle-connected mixed graphs and related problems ⋮ Strong subgraph connectivity of digraphs ⋮ On tree-connectivity and path-connectivity of graphs ⋮ Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs ⋮ Neighbor connectivity of pancake graphs and burnt pancake graphs ⋮ The generalized 4-connectivity of pancake graphs ⋮ Internally disjoint trees in the line graph and total graph of the complete bipartite graph ⋮ Extremal results for directed tree connectivity ⋮ A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs
Cites Work
- Unnamed Item
- Path-connectivity in graphs
- 2-linked graphs
- On the existence of certain disjoint arcs in graphs
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Graph decomposition with applications to subdivisions and path systems modulo k
- A theorem on n-connected graphs
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Minimale n-fach zusammenhängende Graphen mit maximaler Kantenzahl.
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- Extensions of Menger's Theorem†
This page was built for publication: Pendant tree-connectivity