Strong oriented chromatic number of planar graphs without short cycles
Let M be an additive abelian group. A strong oriented coloringof an oriented graph G is a mapping φ from V(G) to M such that (1) φ(u) ≠ φ(v) whenever uv is an arc in G and (2) φ(v) - φ(u) ≠ -(φ(t) - φ(z)) whenever uv and zt are two arcs in G. We say that G has a M-strong-oriented co...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
| Col·lecció: | Discrete Mathematics & Theoretical Computer Science |
| Accés en línia: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/455 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|