Atoms of cyclic edge connectivity in regular graphs
From MaRDI portal
Publication:5963628
DOI10.1007/s10878-014-9759-4zbMath1341.90140OpenAlexW2071131583MaRDI QIDQ5963628
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9759-4
Related Items
On the reliability of modified bubble-sort graphs, Some results about the reliability of folded hypercubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Super cyclically edge connected transitive graphs
- Infinitely many hypohamiltonian cubic graphs of girth 7
- Cyclic edge-cuts in fullerene graphs
- \(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)
- On cyclic edge-connectivity of transitive graphs
- On computing a conditional edge-connectivity of a graph
- On the 2-extendability of planar graphs
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs
- On conditional edge-connectivity of graphs
- Minimale \(n\)-fach kantenzusammenhängende Graphen
- Connectivity of transitive graphs
- On restricted edge-connectivity of graphs.