Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Every 4k-edge-connected graph is Weakly 3k-linked (1990)
    Springer
    Graphs and combinatorics 6 (1990), S. 179-185 
    Details
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We prove: (i) Fork ≥ 2 andα = 0, 1, every (4k + 2α)-edge-connected graph is weakly (3k + 2α)-linked. (ii) IfG is ak-edge-connected graph (k ≥ 2),s, t are vertices andf is an edge, then there exists a pathP betweens andt such thatf ∉ E(P) andG − E(P) − f is (k − 2)-edge-connected, whereE(P) denotes the edge set ofP.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01787729
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...