Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Chung-Ying Yang"'
Autor:
Chung-ying Yang, 楊忠穎
高階經營管理碩士在職專班(EMBA)
100
There are many types of investment, such as equity and currency markets, futures, savings funds, bonds, options, as well as operating small street vendors, running shops and factories, and the
100
There are many types of investment, such as equity and currency markets, futures, savings funds, bonds, options, as well as operating small street vendors, running shops and factories, and the
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/86554814233882547238
Autor:
Chung-Ying Yang, 楊宗穎
98
This thesis discusses colouring, circular list colouring and adapted game colouring of graphs. For colouring, this thesis obtains a sufficient condition for a planar graph to be 3-colourable. Suppose G is a planar graph. Let H_G be the graph
This thesis discusses colouring, circular list colouring and adapted game colouring of graphs. For colouring, this thesis obtains a sufficient condition for a planar graph to be 3-colourable. Suppose G is a planar graph. Let H_G be the graph
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/264n52
Autor:
CHUNG-YING YANG, 楊仲英
96
Faster and radical change is the obvious trend in the 21st century. For the most important part of I-Ging is “change”. Let I-Ging’s basic rule be expressed by systematization, then, it would be helpful for all kinds of affairs. This pap
Faster and radical change is the obvious trend in the 21st century. For the most important part of I-Ging is “change”. Let I-Ging’s basic rule be expressed by systematization, then, it would be helpful for all kinds of affairs. This pap
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/41100956469248758106
Autor:
Chung-ying Yang, 楊宗穎
92
Suppose G is a graph and p >= 2q are positive integers. A color-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) of permissible colors. An L-(p, q)-coloring of G is a (p, q)-coloring h of G such that for each
Suppose G is a graph and p >= 2q are positive integers. A color-list is a mapping L: V --> P(0, 1,...,p-1) which assigns to each vertex a set L(v) of permissible colors. An L-(p, q)-coloring of G is a (p, q)-coloring h of G such that for each
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/txw5yh
Autor:
Chung-Ying Yang
Publikováno v:
Reescrituras del género negro. Estudios literarios y audiovisuales ISBN: 9788411222877
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0b9c6c66f80a98b0865bf0758d1496d
https://doi.org/10.2307/j.ctv2s0jcnz.19
https://doi.org/10.2307/j.ctv2s0jcnz.19
Autor:
Chung-Ying Yang, Fong-Ching Chang, Ru Rutherford, Wen-Yu Chen, Chiung-Hui Chiu, Ping-Hung Chen, Jeng-Tung Chiang, Nae-Fang Miao, Hung-Yi Chuang, Chie-Chien Tseng
Publikováno v:
International Journal of Environmental Research and Public Health; Volume 19; Issue 17; Pages: 10661
In this study, we examined excessive online gaming by adolescents and the resultant effects of their exposure to the online marketing of energy drinks and alcohol, and whether marketing literacy could serve as a mitigating factor. This cross-sectiona
Publikováno v:
Discrete Mathematics. 344:112587
We study 4-list coloring of planar graphs in this paper, and prove that each planar graph without adjacent 3-cycles, adjacent 4-cycles and small suns is 4-choosable.
Autor:
Chung-Ying Yang
Publikováno v:
Estudios Hispánicos. 80:157-182
Publikováno v:
European Journal of Combinatorics. 33(4):435-445
Suppose G=(V,E) is a graph and F is a colouring of its edges (not necessarily proper) that uses the colour set X. In an adapted colouring game, Alice and Bob alternately colour uncoloured vertices of G with colours from X. A partial colouring c of th
Autor:
Xuding Zhu, Chung-Ying Yang
Publikováno v:
Taiwanese J. Math. 15, no. 4 (2011), 1575-1580
Suppose $G$ is a planar graph. Let $H_G$ be the graph with vertex set $V(H_G)=\{ C:C$ is a cycle of G with $|C|\in \{4,6,7\} \}$ and $E(H_G)=\{ C_iC_j: C_i$ and $C_j$ are adjacent in $G\}$. We prove that if any $3$-cycles and $5$-cycles are not adjac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::557b94d15d0f88e0ae637ba4543860c6
http://projecteuclid.org/euclid.twjm/1500406365
http://projecteuclid.org/euclid.twjm/1500406365