Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (Q3548725): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.20243 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4251165316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable trees: A polynomial algorithm for tripodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree bound on decomposable trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On partitioning of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounds for the k-Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342906 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-cuts leaving components of order at least three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On arbitraly vertex decomposable unicyclic graphs with dominating cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing a conditional edge-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts leaving components of given minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arbitrarily vertex decomposable suns with few rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge cuts leaving components of order at least \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.20243 / rank
 
Normal rank

Latest revision as of 11:35, 21 December 2024

scientific article
Language Label Description Also known as
English
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles
scientific article

    Statements

    Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (English)
    0 references
    0 references
    0 references
    0 references
    17 December 2008
    0 references
    restricted edge connectivity
    0 references
    arbitrarily vertex decomposable graph
    0 references
    network reliability
    0 references
    network sharing
    0 references
    ring topology
    0 references

    Identifiers