"Every tree contains a large induced subgraph with all degrees odd."

A. J. Radcliffe, Alex D. Scott (1995)

> Home

Details and statistics

DOI: 10.1016/0012-365X(93)E0186-8

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/RadcliffeS95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/RadcliffeS95
A. J. Radcliffe, Alex D. Scott:
Every tree contains a large induced subgraph with all degrees odd. Discret. Math. 140(1-3): 275-279 (1995)

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.