"The decomposition of graphs into k-connected components."

Walter Holberg (1992)

> Home

Details and statistics

DOI: 10.1016/0012-365X(92)90284-M

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Holberg92
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Holberg92
Walter Holberg:
The decomposition of graphs into k-connected components. Discret. Math. 109(1-3): 133-145 (1992)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.