Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
From MaRDI portal
Publication:3548725
DOI10.1002/NET.20243zbMATH Open1151.05029OpenAlexW4251165316MaRDI QIDQ3548725FDOQ3548725
Authors: Dieter Rautenbach, Lutz Volkmann 
Publication date: 17 December 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00009352
Recommendations
network reliabilityring topologyrestricted edge connectivityarbitrarily vertex decomposable graphnetwork sharing
Cites Work
- On computing a conditional edge-connectivity of a graph
- Title not available (Why is that?)
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Title not available (Why is that?)
- Decomposable trees: A polynomial algorithm for tripodes
- A degree bound on decomposable trees
- Arbitrarily vertex decomposable trees are of maximum degree at most six
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Cuts leaving components of given minimum order
- On partitioning of hypergraphs
- Title not available (Why is that?)
- Arbitrarily vertex decomposable suns with few rays
- Title not available (Why is that?)
- On Bounds for the k-Partitioning of Graphs
- On arbitraly vertex decomposable unicyclic graphs with dominating cycle
Cited In (1)
This page was built for publication: Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548725)
