"Equating k maximum degrees in graphs without short cycles."

Maximilian Fürst et al. (2020)

> Home

Details and statistics

DOI: 10.7151/DMGT.2152

access: open

type: Journal Article

metadata version: 2020-06-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dmgt/FurstGHJR20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/FurstGHJR20
Maximilian Fürst, Michael Gentner, Michael A. Henning, Simon Jäger, Dieter Rautenbach:
Equating k maximum degrees in graphs without short cycles. Discuss. Math. Graph Theory 40(3): 841-853 (2020)

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.