Sufficient conditions for maximally restricted edge connected graphs

DOI10.1016/J.DISC.2012.05.008zbMath1248.05101OpenAlexW2015290526MaRDI QIDQ449147

Jianping Ou, Yingying Qin

Publication date: 12 September 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2012.05.008

zbMATH Keywords

degree sequencerestricted edge connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

\(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs

Cites Work

• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• On graphs with equal edge connectivity and minimum degree
• Extraconnectivity of graphs with large girth
• Super restricted edge connectivity of regular graphs
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Combinatorial optimization problems in the analysis and design of probabilistic networks
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sufficient conditions for maximally restricted edge connected graphs