The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
DOI10.1016/J.DAM.2013.10.028zbMATH Open1284.05065OpenAlexW2074810863MaRDI QIDQ2440128FDOQ2440128
Authors: Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo 
Publication date: 27 March 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.028
Recommendations
- Edges of degree \(k\) in minimally restricted \(k\)-edge connected graphs
- Minimally restricted edge connected graphs
- A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
- scientific article; zbMATH DE number 2197917
- On equality of restricted edge connectivity and minimum edge degree of graphs.
- On Minimum Critically n-Edge-Connected Graphs
- Minimally (k, k)‐edge‐connected graphs
- scientific article; zbMATH DE number 3985264
- Minimum degree and size conditions for the proper connection number of graphs
- scientific article; zbMATH DE number 1998283
extremal graph theoryedge-connectivityrestricted edge connectivityedge-degreeminimum restricted edge connected graphs
Cites Work
- Graph theory with applications
- Title not available (Why is that?)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- THE MAXIMUM CONNECTIVITY OF A GRAPH
- On k-minimally n-edge-connected graphs
- Minimally restricted edge connected graphs
- On Minimum Critically n-Edge-Connected Graphs
Cited In (3)
This page was built for publication: The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2440128)
