• Bulletin of the Korean Mathematical Society
• /
• v.55 no.2
• /
• pp.415-430
• /
• 2018

A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycle. A graph G is acyclically L-list colorable if for a given list assignment $L=\{L(v):v{\in}V(G)\}$, there exists an acyclic coloring ${\phi}$ of G such that ${\phi}(v){\in}L(v)$ for all $v{\in}V(G)$ A graph G is acyclically k-choosable if G is acyclically L-list colorable for any list assignment with $L(v){\geq}k$ for all $v{\in}V(G)$. Let G be a planar graph without 5-cycles and adjacent 4-cycles. In this article, we prove that G is acyclically 5-choosable if every vertex v in G is incident with at most one i-cycle, $i {\in}\{6,7\}$.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.1303-1314
• /
• 2013

An injective coloring of a graph G is an assignment of colors to the vertices of G so that any two vertices with a common neighbor receive distinct colors. A graph G is said to be injectively $k$-choosable if any list $L(v)$ of size at least $k$ for every vertex $v$ allows an injective coloring ${\phi}(v)$ such that ${\phi}(v){\in}L(v)$ for every $v{\in}V(G)$. The least $k$ for which G is injectively $k$-choosable is the injective choosability number of G, denoted by ${\chi}^l_i(G)$. In this paper, we obtain new sufficient conditions to be ${\chi}^l_i(G)={\Delta}(G)$. Maximum average degree, mad(G), is defined by mad(G) = max{2e(H)/n(H) : H is a subgraph of G}. We prove that if mad(G) < $\frac{8k-3}{3k}$, then ${\chi}^l_i(G)={\Delta}(G)$ where $k={\Delta}(G)$ and ${\Delta}(G){\geq}6$. In addition, when ${\Delta}(G)=5$ we prove that ${\chi}^l_i(G)={\Delta}(G)$ if mad(G) < $\frac{17}{7}$, and when ${\Delta}(G)=4$ we prove that ${\chi}^l_i(G)={\Delta}(G)$ if mad(G) < $\frac{7}{3}$. These results generalize some of previous results in [1, 4].

• Bulletin of the Korean Mathematical Society
• /
• v.61 no.1
• /
• pp.263-271
• /
• 2024

A vertex coloring of a graph G is called injective if any two vertices with a common neighbor receive distinct colors. A graph G is injectively k-choosable if any list L of admissible colors on V (G) of size k allows an injective coloring 𝜑 such that 𝜑(v) ∈ L(v) whenever v ∈ V (G). The least k for which G is injectively k-choosable is denoted by χ^l_i(G). For a planar graph G, Bu et al. proved that χ^l_i(G) ≤ ∆ + 6 if girth g ≥ 5 and maximum degree ∆(G) ≥ 8. In this paper, we improve this result by showing that χ^l_i(G) ≤ ∆ + 6 for g ≥ 5 and arbitrary ∆(G).

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.573-580
• /
• 2012

A (1, ${\lambda}$)-embedded graph is a graph that can be embedded on a surface with Euler characteristic ${\lambda}$ so that each edge is crossed by at most one other edge. A graph $G$ is called ${\alpha}$-linear if there exists an integral constant ${\beta}$ such that $e(G^{\prime}){\leq}{\alpha}v(G^{\prime})+{\beta}$ for each $G^{\prime}{\subseteq}G$. In this paper, it is shown that every (1, ${\lambda}$)-embedded graph $G$ is 4-linear for all possible ${\lambda}$, and is acyclicly edge-($3{\Delta}(G)+70$)-choosable for ${\lambda}$ = 1, 2.

• Herbal Formula Science
• /
• v.22 no.2
• /
• pp.121-131
• /
• 2014

Objectives : The purpose of this study is to report a therapeutic effects of a Korean herbal prescription for antibiotics-associated diarrhea. Methods : Modified Hyangsayukgunja-tang was prescribed once or twice a day to a antibiotics-associated diarrhea patient. To observe the therapeutic effects, the frequency of defecation was counted and Bristol Stool Form Index was used. Laboratory tests were conducted periodically. Results : The frequency of defecation was decreased from 9 times a day to once a day. According to Bristol Stool Form Index, stool form was improved from Type 7 to Type 5. The level of red blood cell, hemoglobin and albumin increased slightly from the day of admission to discharge. Conclusions : Hyangsayukgunja-tang can be a choosable treatment option for a serious antibiotics-associated diarrhea.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.1
• /
• pp.59-74
• /
• 2014

The social network service is a online service letting users express the personality and enhancing the human network. However, these features result in side effects which diffuse personal information and make users access to treacherous information. Therefore, various access control models have been proposed. However, the access control mechanisms which encrypt data are only able to be applied for controlling access from direct node, and the access control mechanisms without data encryption allow service provider to access all the information. Moreover, both mechanisms do not consider dynamic changes in reliability of the users. In this paper, we propose relationship-based dynamic access control model including encryption of sensitive data, which consider the characteristics of SNS and improves the security of SNS.

• Management & Information Systems Review
• /
• v.38 no.4
• /
• pp.1-24
• /
• 2019

This study confirms the responses of consumers when the composition of emoticon bundles can be selected by individuals in MIM service. This aims to verify that customized bundling is a valid marketing strategy in the MIM emoticon market. Currently, the emoticon bundling used in Korean MIM services is in the form of pure bundling. As a result, Consumers must purchase an entire bundle even though he/she doesn't need to use all the emoticons contained in it. Some researches(e.g. Hitt & Chen, 2005; Wu & Anandalingam, 2002) show that when consumers value only part of the products or services included in pure bundling, customized bundling is much more profitable. In their works, customized bundling is appropriate when marginal costs are near zero. Information goods, such as emoticons, meet the condition. On the other hand, customized bundling increase the choosable options, so it can pose a problem of complexity (Blecker et al., 2004). And consumers may experience information overload(Huffman & Kahn, 1998). Thus, judgement on the necessity to introduce customized bundling needs to be made through empirical analyses in the light of characteristics of the product and the reaction of consumers. Results show that when customized bundling was introduced, consumers' purchase intention and willingness to pay significantly increased. Purchase intention for customized bundles has increased by 0.44 based on the five point Likert scale than the purchase intention for existing pure bundles. The increase in purchase intention for customized bundles was statistically independent of the existing purchasing experience. In addition, the willingness to pay was increased by about 2.8% compared to the price of the existing emoticon bundles in the whole group. The group with experience in purchasing pure bundles were willing to pay 5.9% more than pure bundles. The other group without experience in purchasing pure bundles were willing to buy if they were about 5% cheaper than the existing price. Overall, introducing customized bundling into emoticon bundles can lead to positive consumers responses and be a viable marketing strategy.