The \(\kappa_k\)-connectivity of line graphs
From MaRDI portal
Publication:2197398
DOI10.1016/j.dam.2020.05.002zbMath1461.05113OpenAlexW3034811005MaRDI QIDQ2197398
Yuan-Yuan Lu, Baoyindureng Wu, Hengzhe Li, Ankang Wei
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.002
Trees (05C05) Enumeration in graph theory (05C30) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing Steiner trees
- Decomposing a graph into pseudoforests with one having bounded degree
- Packing Steiner trees on four terminals
- Packing of Steiner trees and \(S\)-connectors in graphs
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- Pendant tree-connectivity
- Edge-disjoint trees containing some given vertices in a graph
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs
- Steiner tree packing number and tree connectivity
- Every matroid is a submatroid of a uniformly dense matroid
- Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
- The connectivity of line-graphs
- The minimal size of a graph with given generalized 3-edge-connectivity
- On the generalized (edge-)connectivity of graphs
- Generalized Connectivity of Graphs
- Rainbow trees in graphs and generalized connectivity
- On Element-Connectivity Preserving Graph Simplification
- Edge disjoint Steiner trees in graphs without large bridges
- The generalized connectivity of complete bipartite graphs
- Approximation Algorithms for Packing Element-Disjoint Steiner Trees on Bounded Terminal Nodes
This page was built for publication: The \(\kappa_k\)-connectivity of line graphs
