"End-faithful spanning trees in T₁-free graphs."

Norbert Polat (1997)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0118(199712)26:4<175::AID-JGT1>3.0.CO;2-N

access: closed

type: Journal Article

metadata version: 2020-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jgt/Polat97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Polat97
Norbert Polat:
End-faithful spanning trees in T₁-free graphs. J. Graph Theory 26(4): 175-181 (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.