The following pages link to The toughness of split graphs (Q1584388):
Displaying 21 items.
- On the computational complexity of vertex integrity and component order connectivity (Q727981) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Bipartite toughness and \(k\)-factors in bipartite graphs (Q1008540) (← links)
- On splitting the Clebsch graph (Q1344159) (← links)
- A note on the approximability of the toughness of graphs (Q1827680) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- A complete characterization of bidegreed split graphs with four distinct signless Laplacian eigenvalues (Q1979376) (← links)
- Vulnerability of super connected split graphs and bisplit graphs (Q2321673) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Toughness in graphs -- a survey (Q2494126) (← links)
- Edge vulnerability parameters of bisplit graphs (Q2519517) (← links)
- The complexity of recognizing minimally tough graphs (Q2656956) (← links)
- Maximally and super connected multisplit graphs and digraphs (Q5028804) (← links)
- (Q5150664) (← links)
- ISOLATED SCATTERING NUMBER OF SPLIT GRAPHS AND GRAPH PRODUCTS (Q5370790) (← links)
- On Toughness and Hamiltonicity of 2<i>K</i><sub>2</sub>‐Free Graphs (Q5417820) (← links)
- Vulnerability parameters of split graphs (Q5438691) (← links)
- (Q5708558) (← links)
- Minimal toughness in special graph classes (Q6599813) (← links)
- An efficient algorithm to compute the toughness in graphs with bounded treewidth (Q6616440) (← links)
