"All trees contain a large induced subgraph having all degrees 1 (mod k)."

David M. Berman et al. (1997)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(96)00283-X

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/BermanRSWW97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/BermanRSWW97
David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo:
All trees contain a large induced subgraph having all degrees 1 (mod k). Discret. Math. 175(1-3): 35-40 (1997)

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.