k-restricted edge-connectivity in triangle-free graphs

DOI10.1016/J.DAM.2012.01.022MaRDI QIDQ423966zbMATH OpenOpenAlexFDO

Authors Andreas Holtkamp, Dirk Meierling, 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-connectivitysuper-\(\lambda _{k}\)

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• k-restricted edge connectivity in (p+1)-clique-free graphs
• The k-restricted edge connectivity of undirected Kautz graphs
• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• The \(p\)-restricted edge-connectivity of Kneser graphs
• Sufficient conditions for k-restricted edge connected graphs
• On a kind of restricted edge connectivity of graphs
• The upper bound on \(k\)-restricted edge connectivity of a class of Kautz graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• On 3-restricted edge connectivity of undirected binary Kautz graphs
• The restricted edge-connectivity of Kautz undirected graphs.

Cites work

• scientific article; zbMATH DE number 2197917 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Conditional connectivity
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Edge-cuts leaving components of order at least three
• On Representatives of Subsets
• On a kind of restricted edge connectivity of graphs
• On computing a conditional edge-connectivity of a graph
• On the extraconnectivity of graphs
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2

Cited in

(16)

• scientific article; zbMATH DE number 5543113 (Why is no real title available?)
• Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• scientific article; zbMATH DE number 2011856 (Why is no real title available?)
• k-restricted edge connectivity in (p+1)-clique-free graphs
• On k-connectivity problems with sharpened triangle inequality
• 4-factor-criticality of vertex-transitive graphs
• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• The k-restricted edge connectivity of undirected Kautz graphs
• scientific article; zbMATH DE number 2245640 (Why is no real title available?)
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• The \(p\)-restricted edge-connectivity of Kneser graphs
• Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
• Uniform scrambles on graphs
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph

This page was built for publication: \(k\)-restricted edge-connectivity in triangle-free graphs

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