I. Dejter

activity

20072026

most citedPerfect domination in rectangular grid graphs

28 citations · 47 across the 33 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Face $S_{3}$ -colorings and Petrie monochromatic circuits for efficient total arc colorings of cubic maps of girth 4

Italo J Dejter

Let $G = (V (G), E (G))$ be a finite connected simple cubic graph. A total coloring $μ : V (G) \cup E (G) \to {0, 1, 2, 3}$ is efficient if each color yields an efficient dominating se…

math.CO2026

List and total colorings of multiset permutation graphs

Italo J. Dejter

Let $k$ and $ℓ$ be positive integers. The multiset star transposition graph ST $_{k}^{ℓ}$ has as vertices the $k ℓ$ -strings $v_{0} \dots v_{k ℓ - 1}$ on $k$ symbols, each symbol r…

math.CO2026

Efficient total face coloring of planar and toroidal maps

Italo J. Dejter

Let $2 \leq k \in Z$ . A total coloring of a simple connected regular graph via the color set ${0, 1, \dots, k}$ is said to be {\it efficient} if each color yields an efficie…

Face S3​-colorings and Petrie monochromatic circuits for efficient total arc colorings of cubic maps of girth 4

List and total colorings of multiset permutation graphs

Efficient total face coloring of planar and toroidal maps

Face $S_{3}$ -colorings and Petrie monochromatic circuits for efficient total arc colorings of cubic maps of girth 4