Generalized connectivity of some total graphs
From MaRDI portal
Publication:4959532
DOI10.21136/CMJ.2021.0287-19OpenAlexW3173754004MaRDI QIDQ4959532
Yin-Kui Li, Yaping Mao, Zongtian Wei, Zhao Wang
Publication date: 16 September 2021
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/cmj.2021.0287-19
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Edge-disjoint trees containing some given vertices in a graph
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- Note on the hardness of generalized connectivity
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- The connectivity of line-graphs
- On the connectivity of total graphs
- On the generalized (edge-)connectivity of graphs
- Generalized Connectivity of Graphs
- Rainbow trees in graphs and generalized connectivity
- The minimal size of a graph with generalized connectivity $\kappa_3 = 2$
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge disjoint Steiner trees in graphs without large bridges
- A Generalization of Line Connectivity and Optimally Invulnerable Graphs
- The generalized 3-connectivity of random graphs
This page was built for publication: Generalized connectivity of some total graphs
