"Partitions of graphs with high minimum degree or connectivity."

Daniela Kühn, Deryk Osthus (2003)

> Home

Details and statistics

DOI: 10.1016/S0095-8956(03)00028-5

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/KuhnO03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/KuhnO03
Daniela Kühn, Deryk Osthus:
Partitions of graphs with high minimum degree or connectivity. J. Comb. Theory B 88(1): 29-43 (2003)

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.