"Edge coloring a k-tree into two smaller trees."

Dilip Chhajed (1997)

> Home

Details and statistics

DOI: 10.1002/(SICI)1097-0037(199707)29:4<191::AID-NET1>3.0.CO;2-A

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/Chhajed97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/Chhajed97
Dilip Chhajed:
Edge coloring a k-tree into two smaller trees. Networks 29(4): 191-194 (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.