The generalized 3-connectivity of the Mycielskian of a graph
From MaRDI portal
Publication:2008572
DOI10.1016/j.amc.2018.11.006zbMath1428.05170OpenAlexW2904762480WikidataQ128761721 ScholiaQ128761721MaRDI QIDQ2008572
Yan Zhao, Fengwei Li, Ruijuan Gu, Shasha Li
Publication date: 26 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.11.006
Related Items (2)
The 3-path-connectivity of the \(k\)-ary \(n\)-cube ⋮ The generalized 4-connectivity of locally twisted cubes
Cites Work
- Unnamed Item
- Some network topological notions of the Mycielskian of a graph
- Coupon coloring of some special graphs
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\)
- Pendant tree-connectivity
- Path-connectivity in graphs
- Circular chromatic numbers of Mycielski's graphs
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles
- Total rainbow connection of digraphs
- Rainbow vertex connection of digraphs
- The generalized 3-connectivity of graph products
- Steiner tree packing number and tree connectivity
- Note on the hardness of generalized connectivity
- On minimally 2-connected graphs with generalized connectivity \(\kappa_3=2\)
- Connectivity of the Mycielskian of a graph
- The generalized connectivity of complete equipartition 3-partite graphs
- Several parameters of generalized Mycielskians
- Generalized Connectivity of Graphs
- Rainbow trees in graphs and generalized connectivity
- The generalized connectivity of complete bipartite graphs
- The generalized 3-connectivity of Cartesian product graphs
- Sur le coloriage des graphs
This page was built for publication: The generalized 3-connectivity of the Mycielskian of a graph
