"The color-balanced spanning tree problem."

Stefan Berezný, Vladimír Lacko (2005)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition @ kybernetika.cz (open access)
- export record
  dblp key:
  - journals/kybernetika/BereznyL05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/kybernetika/BereznyL05
Stefan Berezný, Vladimír Lacko:
The color-balanced spanning tree problem. Kybernetika 41(4): 539-546 (2005)

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.