Super-connected but not super edge-connected graphs
From MaRDI portal
Publication:1944028
DOI10.1016/j.ipl.2010.10.005zbMath1259.05105OpenAlexW2087817128MaRDI QIDQ1944028
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.005
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Super-connected edge transitive graphs
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Superconnectivity of regular graphs with small diameter
- Super connectivity of line graphs
- Super restricted edge-connectivity of vertex-transitive graphs
- Connectivity of vertex and edge transitive graphs
- Note on the connectivity of line graphs
- Circulants and their connectivities
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- Sufficient conditions for a graph to be super restricted edge-connected
- On super connectivity of Cartesian product graphs
- Synthesis of reliable networks - a survey
- Super edge connectivity properties of connected edge symmetric graphs
- Theory and Application of Graphs
- On restricted edge-connectivity of graphs.
This page was built for publication: Super-connected but not super edge-connected graphs