"Many disjoint dense subgraphs versus large k-connected subgraphs in large ..."

Thomas Böhme, Alexandr V. Kostochka (2009)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2008.01.010

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/BohmeK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BohmeK09
Thomas Böhme, Alexandr V. Kostochka:
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. Discret. Math. 309(4): 997-1000 (2009)

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.