\(k\)-restricted edge-connectivity in triangle-free graphs

DOI10.1016/j.dam.2012.01.022zbMath1243.05131MaRDI QIDQ423966

Dirk Meierling, Andreas Holtkamp, Luis Pedro Montejano

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.022

zbMATH Keywords

triangle-free; \(\lambda _{k}\)-optimal; \(k\)-restricted edge-connectivity; super-\(\lambda _{k}\)

Mathematics Subject Classification ID

05C40: Connectivity

05C07: Vertex degrees

Related Items

Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth, Unnamed Item, Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected, \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs, On the complexity of computing the \(k\)-restricted edge-connectivity of a graph, 4-factor-criticality of vertex-transitive graphs, Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected, The \(p\)-restricted edge-connectivity of Kneser graphs, On the Complexity of Computing the k-restricted Edge-connectivity of a Graph

Cites Work

• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• On computing a conditional edge-connectivity of a graph
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• On the extraconnectivity of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Conditional connectivity
• On Representatives of Subsets
• Unnamed Item
• Unnamed Item