3 hasil untuk "Alexandre Pinlou"
Menampilkan 1–3 · 0,32 detik · RSS
-
Artikel Jurnal
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 coloring. The…
Juga tersedia di: DOAJ
-
Artikel Jurnal
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
For planar graphs, we consider the problems of list edge coloring and list total coloring. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total coloring is the problem of coloring the edges and the vertices while ensuring…