8 hasil untuk "Pascal Ochem"
Menampilkan 1–8 · 0,33 detik · RSS
-
Artikel Jurnal Teks lengkap
On ternary Dejean words avoiding 010
Thue has shown the existence of three types of infinite square-free words over {0,1,2} avoiding the factor 010. They respectively avoid {010,212}, {010,101}, and {010},{020}. Also Dejean constructed an infinite (7/4⁺)-free ternary word. A word is d-directed if it does not contain both a factor of…
-
Artikel Jurnal
Negative results on acyclic improper colorings
Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number $k$ is at most $k2^{k-1}$. We prove that this bound is tight for $k \geq 3$. We also show that some improper and/or acyclic colorings are $\mathrm{NP}$-complete on a class $\mathcal{C}$ of planar…
-
Artikel Jurnal
4-tangrams are 4-avoidable
A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The \emph{cut number} of a tangram is the minimum number of required cuts in this process. Tangrams with cut number one corresponds to squares. For…
-
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
Contact graphs of boxes with unidirectional contacts
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being triangle-free. We give several structural properties of these…
-
Artikel Jurnal
Pseudoperiodic Words and a Question of Shevelev
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more unified manner, and provide a complete answer to one of his…
-
Artikel Jurnal
Antisquares and Critical Exponents
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary words that do not contain arbitrarily large antisquares…