k-restricted edge-connectivity in triangle-free graphs

DOI10.1016/J.DAM.2012.01.022zbMATH Open1243.05131OpenAlexW2017158794MaRDI QIDQ423966FDOQ423966

Dirk Meierling, Luis Pedro Montejano, Andreas Holtkamp

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

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.

zbMATH Keywords

triangle-free\(\lambda _{k}\)-optimal\(k\)-restricted edge-connectivitysuper-\(\lambda _{k}\)

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Cites Work

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

Cited In (15)

• Sufficient conditions for \(\lambda_3\)-optimality of triangle-free graphs
• Title not available (Why is that?)
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Title not available (Why is that?)
• 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
• The \(k\)-restricted edge connectivity of undirected Kautz graphs
• Title not available (Why is that?)
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• The \(p\)-restricted edge-connectivity of Kneser graphs
• On the Complexity of Computing the k-restricted Edge-connectivity of a Graph
• Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• Title not available (Why is that?)

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)