"Degree sequence conditions for maximally edge-connected and ..."

Sebastian Milz, Lutz Volkmann (2018)

> Home

Details and statistics

DOI: 10.1016/J.DISC.2017.09.015

access: closed

type: Journal Article

metadata version: 2020-02-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dm/MilzV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/MilzV18
Sebastian Milz, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number. Discret. Math. 341(2): 484-491 (2018)

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.