Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Arc-chromatic number of digraphs in which every vertex has bounded ..."

Stéphane Bessy, Frédéric Havet, Etienne Birmelé (2006)

> Home

Details and statistics

DOI: 10.1002/JGT.20189

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/BessyHB06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/BessyHB06
Stéphane Bessy, Frédéric Havet, Etienne Birmelé:
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree. J. Graph Theory 53(4): 315-332 (2006)

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.