Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity for partitioning graphs by monochromatic trees, cycles and ..."

Zemin Jin, Xueliang Li (2004)

> Home

Details and statistics

DOI: 10.1080/00207160412331290685

access: closed

type: Journal Article

metadata version: 2017-11-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcm/JinL04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcm/JinL04
Zemin Jin, Xueliang Li:
The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81(11): 1357-1362 (2004)

a service of

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.