The _k-connectivity of line graphs

DOI10.1016/J.DAM.2020.05.002zbMATH Open1461.05113OpenAlexW3034811005MaRDI QIDQ2197398FDOQ2197398

Authors: Hengzhe Li, Yuan-Yuan Lu, Baoyindureng Wu, 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

Recommendations

• \(k\)-tree connectivity of line graphs
• Steiner tree packing number and tree connectivity
• On spanning disjoint paths in line graphs
• Note on the generalized connectivity.
• Edge-disjoint Steiner trees and connectors in graphs

zbMATH Keywords

line graphwheel\(\kappa_k\)-connectivity\(\lambda_k\)-connectivity

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory
• Rainbow trees in graphs and generalized connectivity
• The generalized connectivity of complete bipartite graphs.
• Edge-disjoint trees containing some given vertices in a graph
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Packing Steiner trees
• Packing of Steiner trees and \(S\)-connectors in graphs
• An approximate max-Steiner-tree-packing min-Steiner-cut theorem
• Pendant tree-connectivity
• Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
• The minimal size of a graph with given generalized 3-edge-connectivity.
• On the generalized (edge-)connectivity of graphs
• Edge disjoint Steiner trees in graphs without large bridges
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized Connectivity of Graphs
• Decomposing a graph into pseudoforests with one having bounded degree
• Packing Steiner trees on four terminals
• The connectivity of line-graphs
• Title not available (Why is that?)
• Steiner tree packing number and tree connectivity
• Every matroid is a submatroid of a uniformly dense matroid
• Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
• Approximation algorithms for packing element-disjoint Steiner trees on bounded terminal nodes
• On element-connectivity preserving graph simplification

Cited In (9)

• Steiner tree packing number and tree connectivity
• Internally disjoint trees in the line graph and total graph of the complete bipartite graph
• \(k\)-tree connectivity of line graphs
• Title not available (Why is that?)
• The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants
• On spanning disjoint paths in line graphs
• Essential edge connectivity of line graphs
• Title not available (Why is that?)
• Neighbor connectivity of line graphs

This page was built for publication: The \(\kappa_k\)-connectivity of line graphs

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